A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
From MaRDI portal
Publication:6151530
DOI10.1007/s11590-023-02008-6MaRDI QIDQ6151530
Zhao Zhang, Ding-Zhu Du, Wei Liang
Publication date: 11 March 2024
Published in: Optimization Letters (Search for Journal in Brave)
approximation algorithmpartial coversweep coverbicriteria approximation algorithmbudgeted coverprize-collecting cover
Cites Work
- Unnamed Item
- Unnamed Item
- A 2.5-factor approximation algorithm for the \(k\)-MST problem
- A note on the prize collecting traveling salesman problem
- A better approximation algorithm for the budget prize collecting tree problem.
- Approximate \(k\)-MSTs and \(k\)-Steiner trees via the primal-dual method and Lagrangean relaxation
- Approximation algorithm for prize-collecting sweep cover with base stations
- 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
- Data harvesting with mobile elements in wireless sensor networks
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- An approximation algorithm for general energy restricted sweep coverage problem
- Data sensing with limited mobile sensors in sweep coverage
- Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
- Saving an epsilon
- The prize collecting traveling salesman problem
- New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- A General Approximation Technique for Constrained Forest Problems
- Spanning Trees—Short or Small
- Optimal Coverage in Wireless Sensor Networks
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
This page was built for publication: A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems
