On the multi-radius cover problem

DOI10.1016/J.IPL.2006.04.012zbMATH Open1185.68491OpenAlexW2058941585MaRDI QIDQ845720FDOQ845720

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

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

zbMATH Keywords

approximation algorithmscovering problems

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for NP-hard problems.
• A linear-time approximation algorithm for the weighted vertex cover problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms and Data Structures
• Title not available (Why is that?)
• Experimental and Efficient Algorithms

Cited In (9)

• The complexity of the covering radius problem
• Rounding to an integral program
• Multiple Radii DisC Diversity
• Multicovering bounds from relative covering radii
• Title not available (Why is that?)
• Minimum scan cover with angular transition costs
• Algorithms and Data Structures
• On the Lattice Isomorphism Problem
• Broadcast covers in graphs

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)