Small \(\ell\)-edge-covers in \(k\)-connected graphs

DOI10.1016/j.dam.2013.02.021zbMath1286.05081arXiv1203.6274OpenAlexW1790282222MaRDI QIDQ2446854

Zeev Nutov

Publication date: 22 April 2014

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

Full work available at URL: https://arxiv.org/abs/1203.6274

zbMATH Keywords

approximation algorithms\(k\)-connectivity\(k\)-edge-cover

Mathematics Subject Classification ID

Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

A \(4+\epsilon\) approximation for \(k\)-connected subgraphs

Cites Work

• Approximating survivable networks with \(\beta \)-metric costs
• Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

This page was built for publication: Small \(\ell\)-edge-covers in \(k\)-connected graphs