A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a co

DOI10.1016/J.JALGOR.2005.01.008MaRDI QIDQ5692272zbMATH OpenOpenAlexFDO

Authors Hiroshi Nagamochi

Publication date 28 September 2005

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2005.01.008

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On the minimum local-vertex-connectivity augmentation in graphs
• On the minimum local-vertex-connectivity augmentation in graphs
• A 3/2-approximation algorithm for augmenting the edge-connectivity of a graph from 1 to 2 using a subset of a given edge set (extended abstract)
• NOTE Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
• Simpler and faster vertex connectivity augmentation algorithms. (Extended abstract)

Cited in

(2)

• On the minimum local-vertex-connectivity augmentation in graphs
• On the minimum local-vertex-connectivity augmentation in graphs

This page was built for publication: A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a co

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