A deterministic LP-rounding algorithm achieves a 2-approximation for the forest cover problem, and a 6-approximation for the bounded forest cover problem.
In: Workshop on Algorithms and Data Structures
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Forest Covers and Bounded Forest Covers
A deterministic LP-rounding algorithm achieves a 2-approximation for the forest cover problem, and a 6-approximation for the bounded forest cover problem.