We are concerned with the problem of scheduling monotonic moldable tasks on identical processors to minimize makespan. focus natural case where number m as resources is fixed or relatively small compared n tasks. present an efficient (3/2)-approximation algorithm time complexity O(nmlog(nm)) (for m>n) and O(n2logn) m?n). To best our knowledge, relevant known results are: (a) a (3/2+?)-approxima...

We devise a constant-factor approximation algorithm for the maximization version of edge-disjoint paths problem if supply graph together with demand edges form planar graph. By duality this is equivalent to packing cuts in such that each cut contains exactly one edge. also show natural linear programming relaxations have constant integrality gap, yielding an approximate max-multiflow min-multic...