Approximation algorithm for distance constraint sweep coverage without predetermined base stations

DOI10.1142/S1793830918500647MaRDI QIDQ4554549zbMATH OpenOpenAlexWikidataFDO

Authors Qingqing Chen, Yingli Ran, Xiaohui 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 algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximation algorithms for distance constraint sweep coverage with base stations
• An approximation algorithm for general energy restricted sweep coverage problem
• Approximation algorithm for sweep coverage on graph
• Approximation Algorithms for Barrier Sweep Coverage
• Constant-approximation for prize-collecting min-sensor sweep coverage with base stations

Cites work

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

Cited in

(13)

• 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
• An approximation algorithm for general energy restricted sweep coverage problem
• Algorithms for max-value path sweep coverage in mobile sensor networks
• Energy efficient sweep coverage with mobile and static sensors
• A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
• Approximation algorithms for maximum weighted target cover problem with distance limitations
• Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
• Algorithm for partial sweep coverage on a line
• Approximation algorithm for min sweep-period sweep cover with distance constraint
• Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554549)