×

zbMATH — the first resource for mathematics

Approximating minimum-size \(k\)-connected spanning subgraphs via matching. (English) Zbl 1049.90104

MSC:
90C35 Programming involving graphs or networks
90C59 Approximation methods and heuristics in mathematical programming
05C40 Connectivity
05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85 Graph algorithms (graph-theoretic aspects)
68R10 Graph theory (including graph drawing) in computer science
68W25 Approximation algorithms
90B18 Communication networks in operations research
90C27 Combinatorial optimization
PDF BibTeX XML Cite
Full Text: DOI