Covering Analysis of the Greedy Algorithm for Partial Cover

DOI10.1007/978-3-642-12476-1_7zbMath1284.68715OpenAlexW1550117727MaRDI QIDQ3558262

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Refined algorithms for hitting many intervals ⋮ Calculating approximation guarantees for partial set cover of pairs ⋮ A simple approximation algorithm for minimum weight partial connected set cover ⋮ Pairs Covered by a Sequence of Sets ⋮ Approximating Partially Bounded Degree Deletion on Directed Graphs

This page was built for publication: Covering Analysis of the Greedy Algorithm for Partial Cover