Faster approximation algorithms for weighted triconnectivity augmentation problems

Authors:
Zeev Nutov;Michal Penn
Affiliations:
Applied Mathematics, Technion, Israel Institute of Technology, Haifa 32000, Israel;Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa 32000, Israel
Venue:
Operations Research Letters
Year:
1997

Citing 6
Cited 0

Approximation algorithms for graph augmentation

Journal of Algorithms
On the optimal vertex-connectivity augmentation

Journal of Combinatorial Theory Series B
Approximation algorithms for finding highly connected subgraphs

Approximation algorithms for finding highly connected subgraphs
Improved approximation algorithms for uniform connectivity problems

Journal of Algorithms
Improved approximation algorithms for weighted 2-and 3-vertex connectivity augmentation problems

Journal of Algorithms
A representation for crossing set families with applications to submodular flow problems

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of finding a minimum-weight augmenting edge-set to make a graph 3-vertex connected is considered. This problem is known to be NP-complete. We present a new 3-approximation algorithm for making an arbitrary graph 3-vertex connected. Our algorithm is simpler and faster than the previously known 3-approximation algorithm by a factor of O(n^2), where n is the number of vertices of the graph. We also consider the problem of increasing the vertex-connectivity of a 2-connected graph from 2 to 3.