Faster approximation algorithms for weighted triconnectivity augmentation problems

DOI10.1016/S0167-6377(97)00045-XzbMath0908.90262MaRDI QIDQ1267191

Zeev Nutov, Michal Penn

Publication date: 23 March 1999

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

zbMATH Keywords

graphvertex connectivityaugmentation problem3-approximation algorithmminimum-weight augmenting edge-set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• An approximation algorithm for minimum-cost vertex-connectivity problems
• An application of submodular flows
• On the optimal vertex-connectivity augmentation
• NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
• Approximation Algorithms for Several Graph Augmentation Problems
• Approximation Algorithms for Graph Augmentation
• Augmentation Problems
• Dividing a Graph into Triconnected Components
• Improved Approximation Algorithms for Uniform Connectivity Problems

This page was built for publication: Faster approximation algorithms for weighted triconnectivity augmentation problems