Approximation algorithm for sweep coverage on graph

DOI10.1016/j.ipl.2015.03.011zbMath1329.68288OpenAlexW2018607199MaRDI QIDQ2346569

Partha Sarathi Mandal, Barun Gorain

Publication date: 2 June 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.03.011

zbMATH Keywords

approximation algorithmswireless sensor networkssweep coverageTSP tour

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (8)

Constant-approximation for prize-collecting min-sensor sweep coverage with base stations ⋮ Approximation algorithm for distance constraint sweep coverage without predetermined base stations ⋮ Approximation algorithm for prize-collecting sweep cover with base stations ⋮ Group sweep coverage with guaranteed approximation ratio ⋮ Approximation algorithms for distance constraint sweep coverage with base stations ⋮ A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems ⋮ Approximation Algorithms for Barrier Sweep Coverage ⋮ Solving energy issues for sweep coverage in wireless sensor networks

Cites Work

• Unnamed Item
• Fence patrolling by mobile agents with distinct speeds
• Solving energy issues for sweep coverage in wireless sensor networks
• On the Discrete Unit Disk Cover Problem
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
• Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks

This page was built for publication: Approximation algorithm for sweep coverage on graph