Approximation algorithm for distance constraint sweep coverage without predetermined base stations

DOI10.1142/S1793830918500647zbMath1486.68252OpenAlexW2884985914WikidataQ129560324 ScholiaQ129560324MaRDI QIDQ4554549

Qingqing Chen, Yingli Ran, Xiao-hui Huang

Publication date: 14 November 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830918500647

zbMATH Keywords

approximation algorithmdistance constraintsweep-coverage

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (5)

Constant-approximation for prize-collecting min-sensor sweep coverage with 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 ⋮ Approximation algorithms for distance constraint sweep coverage with base stations ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems

Cites Work

• Approximation algorithm for sweep coverage on graph
• Solving energy issues for sweep coverage in wireless sensor networks
• Approximation algorithms for distance constraint sweep coverage with base stations
• Approximations for minimum and min-max vehicle routing problems

This page was built for publication: Approximation algorithm for distance constraint sweep coverage without predetermined base stations