43 search results - page 1 / 9 » Approximation Algorithms for Mixed Fractional Packing and Co... |
WAOA
2004
Springer
13 years 10 months ago
2004
Springer
FOCS
1991
IEEE
13 years 8 months ago
1991
IEEE
ESCAPE
2007
Springer
13 years 11 months ago
2007
Springer
DC
2011
12 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
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...