Preserving approximation in the min-weighted set cover problem

DOI10.1016/S0166-218X(96)00047-9zbMath0865.68095DBLPjournals/dam/GambosiPT97WikidataQ59256045 ScholiaQ59256045MaRDI QIDQ674914

Giorgio Gambosi, Maurizio Talamo, Marco Protasi

Publication date: 30 June 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Chvatal's algorithmmin-weighted set cover problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Trajectory optimization of laser-charged UAV to minimize the average age of information for wireless rechargeable sensor network ⋮ Absolute \(o(\log m)\) error in approximating random set covering: an average case analysis

Cites Work

• Unnamed Item
• A Greedy Heuristic for the Set-Covering Problem
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems

This page was built for publication: Preserving approximation in the min-weighted set cover problem