A Tight Analysis of the Greedy Algorithm for Set Cover
From MaRDI portal
Recommendations
Cited in
(46)- On a posterior evaluation of a simple greedy method for set packing
- A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem
- A note on the generalized min-sum set cover problem
- A note on the set union knapsack problem
- Guarantees for the success frequency of an algorithm for finding Dodgson-election winners
- Finding the maximal adversary structure from any given access structure
- On the approximation ability of evolutionary optimization with application to minimum set cover
- An algorithmic framework for solving geometric covering problems -- with applications
- SOFSEM 2005: Theory and Practice of Computer Science
- A \(\Theta (\log n)\)-approximation for the set cover problem with set ownership
- Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing
- scientific article; zbMATH DE number 1855640 (Why is no real title available?)
- Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover
- Remoteness of permutation codes
- A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem
- On approximation of the vertex cover problem in hypergraphs
- Combinatorial optimization algorithms for radio network planning
- Improved performance of the greedy algorithm for partial cover
- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
- A new approximation algorithm for k-set cover problem
- Generalized submodular cover problems and applications
- A threshold of ln n for approximating set cover
- Novel trip agglomeration methods for efficient extraction of urban mobility patterns
- Tight approximation bounds for greedy frugal coverage algorithms
- Greedy ${\ensuremath{\Delta}}$ -Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost
- Cost sharing and strategyproof mechanisms for set cover games
- A modified greedy algorithm for dispersively weighted 3-set cover
- scientific article; zbMATH DE number 847791 (Why is no real title available?)
- Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs
- A unified approach to approximating partial covering problems
- Deep approximation of set cover greedy algorithm for test set
- Uniform unweighted set cover: the power of non-oblivious local search
- Algorithms – ESA 2005
- Approximation and Online Algorithms
- Approximating activation edge-cover and facility location problems
- An approval-based model for single-step liquid democracy
- On the approximability of covering points by lines and related problems
- Analysis of approximation algorithms for k-set cover using factor-revealing linear programs
- Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis
- The constant inapproximability of the parameterized dominating set problem
- Approximating \(k\)-generalized connectivity via collapsing HSTs
- scientific article; zbMATH DE number 7561664 (Why is no real title available?)
- Tight bounds for single-pass streaming complexity of the set cover problem
- A greedy algorithm to construct covering arrays using a graph representation
- An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs
- Covering analysis of the greedy algorithm for partial cover
This page was built for publication: A Tight Analysis of the Greedy Algorithm for Set Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373001)
