Approximating the Unweighted ::::k::::-Set Cover Problem: Greedy Meets Local Search

Asaf Levin. Approximating the Unweighted ::::k::::-Set Cover Problem: Greedy Meets Local Search. In Thomas Erlebach, Christos Kaklamanis, editors, Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers. Volume 4368 of Lecture Notes in Computer Science, pages 290-301, Springer, 2006. [doi]

Abstract

Abstract is missing.