43 search results - page 1 / 9 » Approximation Algorithms for Mixed Fractional Packing and Co... |
FOCS
1991
IEEE
15 years 3 months ago
1991
IEEE
161
Voted
ESCAPE
2007
Springer
15 years 6 months ago
2007
Springer
178
Voted
DC
2011
14 years 1 days ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
115
click to vote
SODA
2001
ACM
15 years 1 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...