TY - GEN

T1 - Packing-based approximation algorithm for the k-set cover problem

AU - Fürer, Martin

AU - Yu, Huiwen

PY - 2011

Y1 - 2011

N2 - We present a packing-based approximation algorithm for the k-Set Cover problem. We introduce a new local search-based k-set packing heuristic, and call it Restricted k-Set Packing. We analyze its tight approximation ratio via a complicated combinatorial argument. Equipped with the Restricted k-Set Packing algorithm, our k-Set Cover algorithm is composed of the k-Set Packing heuristic [8] for k ≥ 7, Restricted k-Set Packing for k = 6,5,4 and the semi-local (2,1)-improvement [2] for 3-Set Cover. We show that our algorithm obtains a tight approximation ratio of H k - 0.6402 + Θ(1/k), where H k is the k-th harmonic number. For small k, our results are 1.8667 for k = 6, 1.7333 for k = 5 and 1.5208 for k = 4. Our algorithm improves the currently best approximation ratio for the k-Set Cover problem of any k ≥ 4.

AB - We present a packing-based approximation algorithm for the k-Set Cover problem. We introduce a new local search-based k-set packing heuristic, and call it Restricted k-Set Packing. We analyze its tight approximation ratio via a complicated combinatorial argument. Equipped with the Restricted k-Set Packing algorithm, our k-Set Cover algorithm is composed of the k-Set Packing heuristic [8] for k ≥ 7, Restricted k-Set Packing for k = 6,5,4 and the semi-local (2,1)-improvement [2] for 3-Set Cover. We show that our algorithm obtains a tight approximation ratio of H k - 0.6402 + Θ(1/k), where H k is the k-th harmonic number. For small k, our results are 1.8667 for k = 6, 1.7333 for k = 5 and 1.5208 for k = 4. Our algorithm improves the currently best approximation ratio for the k-Set Cover problem of any k ≥ 4.

UR - http://www.scopus.com/inward/record.url?scp=84055217282&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055217282&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25591-5_50

DO - 10.1007/978-3-642-25591-5_50

M3 - Conference contribution

AN - SCOPUS:84055217282

SN - 9783642255908

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 484

EP - 493

BT - Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings

T2 - 22nd International Symposium on Algorithms and Computation, ISAAC 2011

Y2 - 5 December 2011 through 8 December 2011

ER -