Unsplittable Flow Cut Gap in Undirected Graphs

David Alemán Espinosa, Nikhil Kumar 0001, Joseph Poremba, F. Bruce Shepherd. Unsplittable Flow Cut Gap in Undirected Graphs. In Kasper Green Larsen, Barna Saha, editors, Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2026, Vancouver, BC, Canada, January 11-14, 2026. pages 1570-1605, SIAM, 2026. [doi]

Abstract

Abstract is missing.