Finding 2-edge connected spanning subgraphs.

DOI10.1016/j.orl.2003.08.006zbMath1044.90084OpenAlexW2031140568MaRDI QIDQ1426722

Woonghee Tim Huh

Publication date: 15 March 2004

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.08.006

zbMATH Keywords

Linear programmingApproximation algorithmGraph2-edge connectivity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs ⋮ A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges

Cites Work

• Biconnectivity approximations and graph carvings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding 2-edge connected spanning subgraphs.