Matching Based Augmentations for Approximating Connectivity Problems

DOI10.1007/11682462_4zbMath1145.68597OpenAlexW1504535901MaRDI QIDQ3525741

R. Ravi

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_4

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Connectivity (05C40)

Related Items (2)

New approaches to multi-objective optimization ⋮ Approximating \(k\)-generalized connectivity via collapsing HSTs

This page was built for publication: Matching Based Augmentations for Approximating Connectivity Problems