Covering a line segment with variable radius discs
From MaRDI portal
Publication:960389
DOI10.1016/J.COR.2008.02.013zbMATH Open1175.90253OpenAlexW2079936333MaRDI QIDQ960389FDOQ960389
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
Recommendations
- Line segment disk cover
- Line segment disk cover
- Covering the plane by a sequence of circular disks with a constraint
- Covering of the plane by discs
- Covering a disk by disks
- Covering the plane with copies of a convex disk
- The variable radius covering problem
- Publication:3196931
- Covering with fat convex discs
- Covering a set of line segments with a few squares
Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Mixed integer programming (90C11) Discrete location and assignment (90B80)
Cites Work
- Almost optimal set covers in finite VC-dimension
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation schemes for covering and packing problems in image processing and VLSI
- A combinatorial theorem in plane geometry
- Minimum-cost coverage of point sets by disks
- The station location problem on two intersecting lines
Cited In (16)
- Line segment disk cover
- Line segment disk cover
- “Green” Barrier Coverage with Mobile Sensors
- ``Green barrier coverage with mobile sensors
- Covering moving points with anchored disks
- Radar placement along banks of river
- Novel hybrid heuristics for an extension of the dynamic relay deployment problem over disaster areas
- A heuristic algorithm for minimax sensor location in the plane
- 2-Covered paths by a set of antennas with minimum power transmission range
- Worst-case optimal covering of rectangles by disks
- Optimal 2-coverage of a polygonal region in a sensor network
- Demand allocation with latency cost functions
- A PTAS for the disk cover problem of geometric objects
- The variable radius covering problem
- Maximizing Barrier Coverage Lifetime with Mobile Sensors
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
This page was built for publication: Covering a line segment with variable radius discs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q960389)
