NC approximation algorithms for 2-connectivity augmentation in a graph

DOI10.1007/BFB0002767MaRDI QIDQ4536968zbMATH OpenFDO

Authors W. Liang, George Havas

Publication date 6 November 2002

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

Full work available at URL https://doi.org/10.1007/BFB0002767

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Approximation algorithms (68W25)

Recommendations

• Approximation Algorithms for Graph Augmentation
• A faster approximation algorithm for 2-edge-connectivity augmentation
• Approximation algorithms for graph augmentation
• Approximating biconnectivity in parallel
• 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)

Cited in

(7)

• Approximating biconnectivity in parallel
• A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
• Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
• Approximation Algorithms for Graph Augmentation
• A faster approximation algorithm for 2-edge-connectivity augmentation
• scientific article; zbMATH DE number 1979724 (Why is no real title available?)
• Towards more precise parallel biconnectivity approximation

This page was built for publication: NC approximation algorithms for 2-connectivity augmentation in a graph

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