43 search results - page 3 / 9 » Approximation Algorithms for Mixed Fractional Packing and Co... |
PODC
2009
ACM
14 years 7 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...
SIGECOM
2011
ACM
12 years 9 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...
SPAA
2010
ACM
13 years 11 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
FCT
2007
Springer
14 years 16 days 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...
FOCS
2006
IEEE
14 years 12 days 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...