A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
From MaRDI portal
Recommendations
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- scientific article; zbMATH DE number 2081030
- SOFSEM 2005: Theory and Practice of Computer Science
- A Tight Analysis of the Greedy Algorithm for Set Cover
Cited in
(32)- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- Approximation algorithm for prize-collecting weighted set cover with fairness constraints
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search
- Algorithms and Computation
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
- On the approximation ability of evolutionary optimization with application to minimum set cover
- SOFSEM 2005: Theory and Practice of Computer Science
- Multidepot capacitated vehicle routing with improved approximation guarantees
- Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP
- Covering arrays via set covers
- Improved approximation algorithms for multidepot capacitated vehicle routing
- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
- A new approximation algorithm for k-set cover problem
- scientific article; zbMATH DE number 1947050 (Why is no real title available?)
- scientific article; zbMATH DE number 784428 (Why is no real title available?)
- Faster approximation algorithm for the k-regret minimizing set and related problems
- A constant factor approximation algorithm for generalized MIN-sum set cover
- Problems and algorithms for covering arrays via set covers
- A modified greedy algorithm for dispersively weighted 3-set cover
- The set cover problem with interval weights and the greedy algorithm for its solution
- Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
- Uniform unweighted set cover: the power of non-oblivious local search
- Approximation and Online Algorithms
- Set-cover approximation
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
- A generalization of the weighted set covering problem
- On the differential approximation of MIN SET COVER
- What is the best greedy-like heuristic for the weighted set covering problem?
- scientific article; zbMATH DE number 2081030 (Why is no real title available?)
This page was built for publication: A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5700576)
