Back to Search
Start Over
New approximation algorithms for the rooted Budgeted Cycle Cover problem.
- Source :
-
Theoretical Computer Science . Jan2023:Part A, Vol. 940, p283-295. 13p. - Publication Year :
- 2023
-
Abstract
- The rooted Budgeted Cycle Cover (BCC) problem is a fundamental optimization problem arising in wireless sensor networks and vehicle routing. Given a metric space (V , w) with vertex set V consisting of two parts D (containing depots) and V ∖ D (containing nodes), and a budget B ≥ 0 , the rooted BCC problem asks to find a minimum number of cycles to cover all the nodes in V ∖ D , satisfying that each cycle has length at most B and each cycle must contain a depot in D. In this paper, we give new approximation algorithms for the rooted BCC problem. For the rooted BCC problem with single depot, we give an O (log B μ) -approximation algorithm, where μ is the minimum difference of any two different distances between the vertices in V and the root. For the rooted BCC problem with multiple depots, we give an O (log n) -approximation algorithm, where n is the number of vertices. We also test our algorithms on the randomly generated instances. The experimental results show that the algorithms have good performance in practice. • A log-factor approximation algorithm for the single depot budgeted cycle cover problem. • A log-factor approximation algorithm for the multi-depot budgeted cycle cover problem. • Experiments on randomly generated instances show good performance of the algorithms. [ABSTRACT FROM AUTHOR]
- Subjects :
- *APPROXIMATION algorithms
*WIRELESS sensor networks
*METRIC spaces
Subjects
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 940
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 160400932
- Full Text :
- https://doi.org/10.1016/j.tcs.2022.11.009