31 search results - page 1 / 7 » Sequential and Parallel Algorithms for Mixed Packing and Cov... |
93
Voted
CORR
2002
Springer
14 years 10 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 ...
156
Voted
DC
2011
13 years 10 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...
144
Voted
ESCAPE
2007
Springer
15 years 5 months ago
2007
Springer
122
Voted
WAOA
2004
Springer
15 years 4 months ago
2004
Springer
102
click to vote
SODA
2001
ACM
15 years 7 days 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...