Sciweavers

Share
33 search results - page 1 / 7
» Sequential and Parallel Algorithms for Mixed Packing and Cov...
Sort
View
CORR
2002
Springer
133views Education» more  CORR 2002»
8 years 10 months ago
Sequential and Parallel Algorithms for Mixed Packing and Covering
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 ...
Neal E. Young
DC
2011
7 years 10 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
8 years 11 months ago
New approaches to covering and packing problems
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...
Aravind Srinivasan
books