A faster approximation algorithm for 2-edge-connectivity augmentation

DOI10.1007/3-540-36136-7_14MaRDI QIDQ4425950zbMATH OpenFDO

Authors A. Galluccio, Guido Proietti

Publication date 14 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180150.htm

zbMATH Keywords

Approximation AlgorithmsEdge-Connectivity AugmentationNetwork Survivability

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Polynomial time algorithms for 2-edge-connectivity augmentation problems
• Approximation algorithms for graph augmentation
• Approximation Algorithms for Graph Augmentation
• Faster approximation algorithms for weighted triconnectivity augmentation problems
• NC approximation algorithms for 2-connectivity augmentation in a graph

Cited in

(12)

• Polynomial time algorithms for 2-edge-connectivity augmentation problems
• NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
• A \({(1+\ln 2)}\)-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius
• scientific article; zbMATH DE number 1256717 (Why is no real title available?)
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• scientific article; zbMATH DE number 2081003 (Why is no real title available?)
• NC approximation algorithms for 2-connectivity augmentation in a graph
• Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
• Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
• Algorithms and Computation
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Breaching the 2-Approximation Barrier for Connectivity Augmentation: A Reduction to Steiner Tree

This page was built for publication: A faster approximation algorithm for 2-edge-connectivity augmentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4425950)