🔮
🔮
The Ethereal
Two-connected spanning subgraphs with at most $\frac{10}{7}$OPT edges
September 01, 2016 · The Ethereal · 🏛 SIAM Journal on Discrete Mathematics
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Klaus Heeger, Jens Vygen
arXiv ID
1609.00147
Category
math.CO: Combinatorics
Cross-listed
cs.DM,
cs.DS
Citations
3
Venue
SIAM Journal on Discrete Mathematics
Last Checked
6 months ago
Abstract
We present a $\frac{10}{7}$-approximation algorithm for the minimum two-vertex-connected spanning subgraph problem.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal