Tight Approximation Algorithm for Connectivity Augmentation Problems

DOI10.1007/11786986_39zbMath1182.68364OpenAlexW1540489585MaRDI QIDQ3613780

Guy Kortsarz, Zeev Nutov

Publication date: 12 March 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11786986_39

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (1)

Approximation Algorithms for Prize-Collecting Network Design Problems with General Connectivity Requirements

This page was built for publication: Tight Approximation Algorithm for Connectivity Augmentation Problems