Algorithm for partial sweep coverage on a line
From MaRDI portal
Publication:6633537
DOI10.1016/J.DAM.2024.08.003MaRDI QIDQ6633537
Publication date: 6 November 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
dynamic programmingenergy consumptionapproximation ratiomobile sensorbicriteria algorithmsweep cover
Algorithms in computer science (68Wxx) Mathematical programming (90Cxx) Operations research and management science (90Bxx)
Cites Work
- Minimizing the total cost of barrier coverage in a linear domain
- Time sensitive sweep coverage with minimum UAVs
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- Approximation algorithm for prize-collecting sweep cover with base stations
- Group sweep coverage with guaranteed approximation ratio
- An efficient genetic algorithm for maximizing area coverage in wireless sensor networks
- Approximation algorithm for sweep coverage on graph
- Fence patrolling by mobile agents with distinct speeds
- Solving energy issues for sweep coverage in wireless sensor networks
- Approximation algorithms for distance constraint sweep coverage with base stations
- An approximation algorithm for general energy restricted sweep coverage problem
- Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- Optimal Coverage in Wireless Sensor Networks
- Approximation Algorithms for Barrier Sweep Coverage
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
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)
