Abstract
The minimum cardinality 3-edge-connected spanning subgraph problem is considered. An approximation algorithm with a performance ratio of 4/3 ≈ 1.33 is presented. This improves the previous best ratio of 3/2 for the problem. The algorithm also works on multigraphs and guarantees the same approximation ratio. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Gubbala, P., & Raghavachari, B. (2007). A 4/3-approximation algorithm for minimum 3-edge-connectivity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 39–51). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
