Approximation Algorithms for Barrier Sweep Coverage

DOI10.1142/S0129054119500138zbMath1415.68265arXiv1704.02436OpenAlexW2963368108MaRDI QIDQ5384125

Barun Gorain, Partha Sarathi Mandal

Publication date: 21 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.02436

zbMATH Keywords

TSPapproximation algorithmEulerian graphwireless sensor networksbarrier coveragedata gatheringmobile sensorsweep coveragedata mule

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Approximation algorithms (68W25) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Group sweep coverage with guaranteed approximation ratio

Cites Work

• Worst-case analysis of a new heuristic for the travelling salesman problem
• 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
• Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds

This page was built for publication: Approximation Algorithms for Barrier Sweep Coverage