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...
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...
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...
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...