Algorithm for partial sweep coverage on a line
From MaRDI portal
Recommendations
- An approximation algorithm for general energy restricted sweep coverage problem
- Solving energy issues for sweep coverage in wireless sensor networks
- Energy efficient sweep coverage with mobile and static sensors
- Approximation Algorithms for Barrier Sweep Coverage
- Approximation algorithm for sweep coverage on graph
Cites work
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
- An approximation algorithm for general energy restricted sweep coverage problem
- An efficient genetic algorithm for maximizing area coverage in wireless sensor networks
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- Approximation algorithm for prize-collecting sweep cover with base stations
- Approximation algorithm for sweep coverage on graph
- Approximation Algorithms for Barrier Sweep Coverage
- Approximation algorithms for distance constraint sweep coverage with base stations
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- Group sweep coverage with guaranteed approximation ratio
- Minimizing the total cost of barrier coverage in a linear domain
- Optimal coverage in wireless sensor networks
- Solving energy issues for sweep coverage in wireless sensor networks
- Time sensitive sweep coverage with minimum UAVs
Cited in
(1)
This page was built for publication: Algorithm for partial sweep coverage on a line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633537)
