Approximating Subset k-Connectivity Problems

DOI10.1007/978-3-642-29116-6_2zbMath1242.68370OpenAlexW1752264143MaRDI QIDQ2896372

Zeev Nutov

Publication date: 16 July 2012

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29116-6_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

Approximating minimum-cost edge-covers of crossing biset-families

This page was built for publication: Approximating Subset k-Connectivity Problems