58 search results - page 1 / 12 » Fast Approximation Algorithms for Fractional Packing and Cov... |
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
FOCS
1998
IEEE
13 years 9 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...
SPAA
2010
ACM
13 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...