scientific article; zbMATH DE number 2079404

zbMath1092.68629MaRDI QIDQ4471364

Balaji Raghavachari, Raja Jothi, Subramanian Varadarajan

Publication date: 28 July 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

undirected graphs2-edge-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (8)

Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges ⋮ A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem ⋮ A global approach for designing reliable WDM networks and grooming the traffic ⋮ Dual-based approximation algorithms for cut-based network connectivity problems ⋮ 1.61-approximation for min-power strong connectivity with two power levels ⋮ On the maximum size of a minimal \(k\)-edge connected augmentation ⋮ Strongly Connected Spanning Subgraph for Almost Symmetric Networks

This page was built for publication: