On the multi-radius cover problem

DOI10.1016/j.ipl.2006.04.012zbMath1185.68491OpenAlexW2058941585MaRDI QIDQ845720

Julián Mestre

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.012

zbMATH Keywords

approximation algorithmscovering problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Rounding to an integral program

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time approximation algorithm for the weighted vertex cover problem
• Algorithms and Data Structures
• Experimental and Efficient Algorithms

This page was built for publication: On the multi-radius cover problem