π
π
The Cartographer
A New Approximation Algorithm for the Minimum 2-Edge-Connected Spanning Subgraph Problem
November 17, 2019 Β· Declared Dead Β· π Theoretical Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ali Γivril
arXiv ID
1911.07232
Category
cs.DS: Data Structures & Algorithms
Citations
6
Venue
Theoretical Computer Science
Last Checked
4 months ago
Abstract
We present a new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem. Its approximation ratio is $\frac{4}{3}$, which matches the current best ratio. The approximation ratio of the algorithm is $\frac{6}{5}$ on subcubic graphs, which is an improvement upon the previous best ratio of $\frac{5}{4}$. The algorithm is a novel extension of the primal-dual schema, which consists of two distinct phases. Both the algorithm and the analysis are much simpler than those of the previous approaches.
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