Covering a line segment with variable radius discs

DOI10.1016/j.cor.2008.02.013zbMath1175.90253OpenAlexW2079936333MaRDI QIDQ960389

Andrea Pacifici, Pitu B. Mirchandani, Alessandro Agnetis, Enrico Grande

Publication date: 17 December 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/10964

zbMATH Keywords

sensor locationmixed integer nonlinear programmingnetwork covering problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonlinear programming (90C30) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (12)

Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas ⋮ Optimal 2-coverage of a polygonal region in a sensor network ⋮ “Green” Barrier Coverage with Mobile Sensors ⋮ Covering moving points with anchored disks ⋮ Demand allocation with latency cost functions ⋮ Radar placement along banks of river ⋮ A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters ⋮ A PTAS for the disk cover problem of geometric objects ⋮ ``Green barrier coverage with mobile sensors ⋮ 2-Covered paths by a set of antennas with minimum power transmission range ⋮ Line segment disk cover ⋮ Maximizing Barrier Coverage Lifetime with Mobile Sensors

Cites Work

• A combinatorial theorem in plane geometry
• Almost optimal set covers in finite VC-dimension
• Approximation schemes for covering and packing problems in image processing and VLSI
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Covering a line segment with variable radius discs