Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
Lecture notes in computer science2007pp. 290–301
Citations Over TimeTop 13% of 2007 papers
Related Papers
- → Covering Analysis of the Greedy Algorithm for Partial Cover(2010)12 cited
- → An Efficient Algorithm for Finding an Irredundant Set Cover(1974)9 cited
- → An Improved Heuristic Algorithm for the special case of the set covering problem(2013)2 cited
- → Improved Greedy Algorithm for Set Covering Problem(2015)5 cited
- → Iteratively reweighted greedy set cover(2020)1 cited