93 search results - page 6 / 19 » Online Primal-Dual Algorithms for Covering and Packing Probl... |
149
click to vote
SPAA
2010
ACM
15 years 6 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...
106
click to vote
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given a family of subsets of an n-element universe, the kcover problem asks whether there are k sets in the family whose union contains the universe; in the k-packing pro...
146
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
104
click to vote
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...
STOC
2003
ACM
16 years 2 months ago
2003
ACM
