On the Cycle Augmentation Problem: hardness and approximation algorithms

DOI10.1007/978-3-030-39479-0_10OpenAlexW3001902986MaRDI QIDQ2193089

Krzysztof Sornat, Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli

Publication date: 24 August 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39479-0_10

zbMATH Keywords

approximation algorithmsconnectivity augmentationcycle augmentationcactus augmentation

Mathematics Subject Classification ID

Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (2)

Flexible Graph Connectivity ⋮ Approximation algorithms for connectivity augmentation problems

This page was built for publication: On the Cycle Augmentation Problem: hardness and approximation algorithms