Faster approximation algorithms for weighted triconnectivity augmentation problems

Zeev Nutov, Michal Penn

Research output: Contribution to journalArticlepeer-review


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(n2), 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.

Original languageEnglish
Pages (from-to)219-223
Number of pages5
JournalOperations Research Letters
Issue number5
StatePublished - 12 Jan 1997
Externally publishedYes

Bibliographical note

Funding Information:
We are grateful to Rafi Hassin for many stimulating discussion. Partial support was received from the Technion fund for promotion of research.


  • Approximation algorithm
  • Augmentation problem
  • Graph
  • Vertex connectivity


Dive into the research topics of 'Faster approximation algorithms for weighted triconnectivity augmentation problems'. Together they form a unique fingerprint.

Cite this