Faster algorithms for all-pairs bounded min-cuts