Approximating minimum size \{1,2\}-connected networks

DOI10.1016/S0166-218X(02)00199-3zbMath1011.68178MaRDI QIDQ1861563

Piotr Krysta

Publication date: 9 March 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

local searchnetwork designgraph connectivityapproximation algorithms

Mathematics Subject Classification ID

Approximation algorithms (68W25) Connectivity (05C40)

Cites Work

• An approximation algorithm for minimum-cost vertex-connectivity problems
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• A primal-dual approximation algorithm for generalized Steiner network problems
• A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
• Biconnectivity approximations and graph carvings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating minimum size \{1,2\}-connected networks