Breaching the 2-approximation barrier for the forest augmentation problem

DOI10.1145/3519935.3520035arXiv2112.11799MaRDI QIDQ6083615

Fabrizio Grandoni, Afrouz Jabal Ameli, Vera Traub

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationnetwork designapproximation algorithmsconnectivity augmentation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Breaching the 2-approximation barrier for the forest augmentation problem