43 search results - page 2 / 9 » Approximation Algorithms for Mixed Fractional Packing and Co... |
CORR
2002
Springer
13 years 5 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 ...
ESA
2005
Springer
13 years 11 months ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
FOCS
1998
IEEE
13 years 9 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...