31 search results - page 1 / 7 » Sequential and Parallel Algorithms for Mixed Packing and Cov... |
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
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...
ESCAPE
2007
Springer
13 years 10 months ago
2007
Springer
WAOA
2004
Springer
13 years 9 months ago
2004
Springer
SODA
2001
ACM
13 years 5 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...