Approximation algorithm for prize-collecting sweep cover with base stations

DOI10.1016/j.tcs.2022.06.026OpenAlexW4283079846WikidataQ114129096 ScholiaQ114129096MaRDI QIDQ2166725

Wei Liang, Zhao Zhang

Publication date: 25 August 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.06.026

zbMATH Keywords

approximation algorithmprize-collectingsweep-coverage

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems

Cites Work

• Group sweep coverage with guaranteed approximation ratio
• 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
• An approximation algorithm for general energy restricted sweep coverage problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Approximation algorithm for distance constraint sweep coverage without predetermined base stations
• A General Approximation Technique for Constrained Forest Problems
• Optimal Coverage in Wireless Sensor Networks

This page was built for publication: Approximation algorithm for prize-collecting sweep cover with base stations