Set-cover approximation
From MaRDI portal
Publication:4635998
Recommendations
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- scientific article; zbMATH DE number 2081030
- The set cover problem with interval weights and the greedy algorithm for its solution
- Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search
- scientific article; zbMATH DE number 784428
Cited in
(9)- Set coverage and robust policy
- Applied Cryptography and Network Security
- scientific article; zbMATH DE number 1947050 (Why is no real title available?)
- Computational experience with approximation algorithms for the set covering problem
- Complexity and approximation of the connected set-cover problem
- The set cover problem with interval weights and the greedy algorithm for its solution
- Benchmark data set with service programs to approximately solve the set covering problem
- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
- Approximate Set Covering in Uniform Hypergraphs
This page was built for publication: Set-cover approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635998)
