58 search results - page 3 / 12 » Fast Approximation Algorithms for Fractional Packing and Cov... |
195
Voted
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
143
Voted
SODA
2001
ACM
15 years 4 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 ...
136
Voted
CORR
2002
Springer
15 years 2 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 ...
112
Voted
FCT
2007
Springer
15 years 9 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
112
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...