Pages that link to "Item:Q3587364"
From MaRDI portal
The following pages link to New Algorithms for Barrier Coverage with Mobile Sensors (Q3587364):
Displaying 18 items.
- Algorithms on minimizing the maximum sensor movement for barrier coverage of a linear domain (Q368758) (← links)
- Optimal sensor networks for area monitoring using rotating and beam sensors (Q489751) (← links)
- Minimizing the aggregate movements for interval coverage (Q527411) (← links)
- On the barrier graph of an arrangement of ray sensors (Q528551) (← links)
- Minimizing the total cost of barrier coverage in a linear domain (Q721928) (← links)
- Distributed algorithms for barrier coverage via sensor rotation in wireless sensor networks (Q724751) (← links)
- Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
- ``Green'' barrier coverage with mobile sensors (Q1998844) (← links)
- A fast FPTAS for two dimensional barrier coverage using sink-based mobile sensors with MinSum movement (Q2151379) (← links)
- Weak coverage of a rectangular barrier (Q2300721) (← links)
- Complexity of barrier coverage with relocatable sensors in the plane (Q2344757) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Approximation algorithm for MinSum linear barrier coverage with sink-based mobile sensors on the plane (Q2680855) (← links)
- “Green” Barrier Coverage with Mobile Sensors (Q2947008) (← links)
- Barrier Coverage with Uniform Radii in 2D (Q5056051) (← links)
- Maximizing Barrier Coverage Lifetime with Mobile Sensors (Q5346541) (← links)
- Improved PTASs for convex barrier coverage (Q5896869) (← links)
- Algorithms for covering multiple barriers (Q5916077) (← links)
