On the multi-radius cover problem

DOI10.1016/J.IPL.2006.04.012MaRDI QIDQ845720zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms and Data Structures
• A note on multicovering with disks
• Minimum-cost coverage of point sets by disks
• Algorithms - ESA 2003
• The minimum generalized vertex cover problem

Cites work

• scientific article; zbMATH DE number 3869066 (Why is no real title available?)
• scientific article; zbMATH DE number 1754596 (Why is no real title available?)
• scientific article; zbMATH DE number 2119748 (Why is no real title available?)
• scientific article; zbMATH DE number 1445320 (Why is no real title available?)
• A linear-time approximation algorithm for the weighted vertex cover problem
• Algorithms and Data Structures
• Approximation algorithms for NP-hard problems.
• Experimental and Efficient Algorithms

Cited in

(9)

• Algorithms and Data Structures
• The complexity of the covering radius problem
• Multiple Radii DisC Diversity
• Rounding to an integral program
• Multicovering bounds from relative covering radii
• Minimum scan cover with angular transition costs
• On the Lattice Isomorphism Problem
• Broadcast covers in graphs
• scientific article; zbMATH DE number 1057736 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845720)