Barrier Coverage with Uniform Radii in 2D
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- A 2-approximation algorithm for barrier coverage by weighted non-uniform sensors on a line
- A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement
- Complexity of barrier coverage with relocatable sensors in the plane
- Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane
- Barrier coverage
- Computing Best Coverage Path in the Presence of Obstacles in a Sensor Field
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- Complexity of barrier coverage with relocatable sensors in the plane
- Barrier coverage with non-uniform lengths to minimize aggregate movements
- A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
- Approximating barrier resilience for arrangements of non-identical disk sensors
- Improved PTASs for convex barrier coverage
- Barrier coverage problem in 2D
- Approximation algorithms for maximum weighted target cover problem with distance limitations
- Optimal placement of mobile sensors for the distance-constrained line routing problem
- Minimizing the total cost of barrier coverage in a linear domain
- Drone placement for optimal barrier coverage
This page was built for publication: Barrier Coverage with Uniform Radii in 2D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056051)