A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity

DOI10.1007/978-3-540-73951-7_5zbMath1209.68642OpenAlexW1556476482MaRDI QIDQ3603513

Balaji Raghavachari, Prabhakar Gubbala

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_5

zbMATH Keywords

combinatorial optimizationconnectivityapproximation algorithmsgraph and network algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

On the maximum size of a minimal \(k\)-edge connected augmentation

This page was built for publication: A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity