Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem

DOI10.1007/11496915_31zbMath1119.90361OpenAlexW1534697130MaRDI QIDQ3596353

Prabhakar Gubbala, Balaji Raghavachari

Publication date: 30 August 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges

This page was built for publication: Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem