170 search results - page 1 / 34 » An Approximation Algorithm for the General Mixed Packing and... |
175
Voted
ESCAPE
2007
Springer
15 years 7 months ago
2007
Springer
140
Voted
WAOA
2004
Springer
15 years 6 months ago
2004
Springer
119
click to vote
CORR
2002
Springer
15 years 28 days 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 ...
189
Voted
DC
2011
14 years 28 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...
141
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
The paper presents distributed and parallel -approximation algorithms for covering problems, where is the maximum number of variables on which any constraint depends (for example...