Covering analysis of the greedy algorithm for partial cover
From MaRDI portal
Publication:3558262
DOI10.1007/978-3-642-12476-1_7zbMATH Open1284.68715OpenAlexW1550117727MaRDI QIDQ3558262FDOQ3558262
Authors: Tapio Elomaa, Jussi Kujala
Publication date: 4 May 2010
Published in: Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-12476-1_7
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cited In (10)
- A Tighter Analysis of Set Cover Greedy Algorithm for Test Set
- Improved performance of the greedy algorithm for partial cover
- Approximating partially bounded degree deletion on directed graphs
- Tight approximation bounds for greedy frugal coverage algorithms
- Calculating approximation guarantees for partial set cover of pairs
- Refined algorithms for hitting many intervals
- A simple approximation algorithm for minimum weight partial connected set cover
- Greedy algorithm for set cover in context of knowledge discovery problems
- A greedy algorithm to construct covering arrays using a graph representation
- Pairs Covered by a Sequence of Sets
This page was built for publication: Covering analysis of the greedy algorithm for partial cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558262)