Breaching the 2-approximation barrier for the forest augmentation problem

Fabrizio Grandoni 0001, Afrouz Jabal Ameli, Vera Traub. Breaching the 2-approximation barrier for the forest augmentation problem. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 1598-1611, ACM, 2022. [doi]

Abstract

Abstract is missing.