Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions

Ming Ding, Rasmus Kyng, Peng Zhang 0052. Two-Commodity Flow Is Equivalent to Linear Programming Under Nearly-Linear Time Reductions. In Mikolaj Bojanczyk, Emanuela Merelli, David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France. Volume 229 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. [doi]

Abstract

Abstract is missing.