Approximation algorithms for distance constraint sweep coverage with base stations
From MaRDI portal
Publication:2424716
DOI10.1007/S10878-018-0341-3zbMath1426.90216OpenAlexW2888568929WikidataQ129341016 ScholiaQ129341016MaRDI QIDQ2424716
Jian Liang, Zhao Zhang, Xiao-hui Huang
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-018-0341-3
Applications of mathematical programming (90C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (6)
Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ Approximation algorithm for distance constraint sweep coverage without predetermined base stations ⋮ 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 ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
Cites Work
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- 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 constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Two exact algorithms for the distance-constrained vehicle routing problem
- On the Distance Constrained Vehicle Routing Problem
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- Approximations for minimum and min-max vehicle routing problems
This page was built for publication: Approximation algorithms for distance constraint sweep coverage with base stations
