scientific article; zbMATH DE number 2079371

MaRDI QIDQ4471330zbMATH OpenFDO

Authors Harold N. Gabow

Publication date 28 July 2004

zbMATH Keywords

\(k\)-ECSS problemKR algorithmlaminar family of sets

Mathematics Subject Classification ID

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

Recommendations

• An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph
• A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
• Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
• Special edges, and approximating the smallest directed k-edge connected spanning subgraph
• Iterated rounding algorithms for the smallest k-edge connected spanning subgraph

Cited in

(5)

• Approximating the smallest k-edge connected spanning subgraph by LP-rounding
• Approximating the smallest \(k\)-edge connected spanning subgraph by LP-rounding
• A Better Approximation Ratio for the Minimum Sizek-Edge-Connected Spanning Subgraph Problem
• An Improved Analysis for Approximating the Smallest k-Edge Connected Spanning Subgraph of a Multigraph
• Special edges, and approximating the smallest directed k-edge connected spanning subgraph

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 Q4471330)