scientific article; zbMATH DE number 2079404

MaRDI QIDQ4471364zbMATH OpenFDO

Authors Raja Jothi, Balaji Raghavachari, Subramanian Varadarajan

Publication date 28 July 2004

zbMATH Keywords

undirected graphs2-edge-connectivity

Mathematics Subject Classification ID

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

Recommendations

• A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
• A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
• A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem
• Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
• scientific article; zbMATH DE number 1187147

Cited in

(20)

• 1.61-approximation for min-power strong connectivity with two power levels
• scientific article; zbMATH DE number 437534 (Why is no real title available?)
• Approximation and Online Algorithms
• Strongly connected spanning subgraph for almost symmetric networks
• Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem
• A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem
• A 4/3-Approximation Algorithm for Minimum 3-Edge-Connectivity
• scientific article; zbMATH DE number 1670548 (Why is no real title available?)
• Dual-based approximation algorithms for cut-based network connectivity problems
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges
• Approximation Algorithms for the Minimum Cardinality Two-Connected Spanning Subgraph Problem
• Two-connected spanning subgraphs with at most \(\frac{10}{7}{\mathrm{OPT}}\) edges
• Correlation clustering and two-edge-connected augmentation for planar graphs
• Toward a 6/5 Bound for the Minimum Cost 2-Edge Connected Spanning Subgraph
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations
• An approximation algorithm for the minimum co-path set problem
• A 4/3-approximation algorithm for the minimum 2-edge connected subgraph problem
• On the maximum size of a minimal \(k\)-edge connected augmentation
• 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

This page was built for publication:

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