π
π
The Cartographer
Forest Covers and Bounded Forest Covers
November 25, 2024 Β· Declared Dead Β· π Conference on Current Trends in Theory and Practice of Informatics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Daya Ram Gaur, Barun Gorain, Shaswati Patra, Rishi Ranjan Singh
arXiv ID
2411.16578
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC,
math.CO
Citations
0
Venue
Conference on Current Trends in Theory and Practice of Informatics
Last Checked
5 months ago
Abstract
We study approximation algorithms for the forest cover and bounded forest cover problems. A probabilistic $2+Ξ΅$ 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 $2+Ξ΅$ approximation algorithm may be of independent interest.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted