Pages that link to "Item:Q5056051"
From MaRDI portal
The following pages link to Barrier Coverage with Uniform Radii in 2D (Q5056051):
Displaying 10 items.
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field (Q450535) (← links)
- Minimizing the total cost of barrier coverage in a linear domain (Q721928) (← links)
- A 2-approximation algorithm for barrier coverage by weighted non-uniform sensors on a line (Q1629942) (← links)
- A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement (Q2151379) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane (Q2680855) (← links)
- Barrier coverage (Q2830235) (← links)
- Improved PTASs for convex barrier coverage (Q5896869) (← links)
- Approximation algorithms for maximum weighted target cover problem with distance limitations (Q6571268) (← links)