Forest Covers and Bounded Forest Covers
Data Structures and Algorithms
2024-11-26 v1 Computational Complexity
Combinatorics
Abstract
We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic approximation algorithm for the forest cover problem is given using the method of dual fitting. A deterministic algorithm with a 2-approximation ratio that rounds the optimal solution to a linear program is given next. The 2-approximation for the forest cover is then used to give a 6-approximation for the bounded forest cover problem. The use of the probabilistic method to develop the approximation algorithm may be of independent interest.
Cite
@article{arxiv.2411.16578,
title = {Forest Covers and Bounded Forest Covers},
author = {Daya Ram Gaur and Barun Gorain and Shaswati Patra and Rishi Ranjan Singh},
journal= {arXiv preprint arXiv:2411.16578},
year = {2024}
}