874 search results - page 1 / 175 » Faster Algorithms for Semi-Matching Problems |
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
JISE
2006
13 years 11 months ago
2006
SODA
1998
ACM
14 years 15 days ago
1998
ACM
FOCS
1998
IEEE
14 years 3 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
SIAMCOMP
2008
13 years 11 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...