Problem
Research questions and friction points this paper is trying to address.
min-cost flow
min-ratio cycle
distance oracles
A Simpler and Faster Min-Cost Flow Solver via Min-Ratio Cycles from Distance Oracles
๐ค AI Summary
ๆฌๆ้่ฟ็ดๆฅไปๅจๆ่ท็ฆป้ข่จๆบๆๅๆๅฐๆฏ็็ฏ๏ผ็ฎๅๅนถๅ ้ไบๆๅฐ่ดน็จๆต้ฎ้ข็่งฃๅณๆนๆณใ
๐ Abstract
The first almost-linear time maximum and minimum cost flow algorithm of Chen-Kyng-Liu-Peng-Probst Gutenberg-Sachdeva (FOCS 2022), reduced these flow objectives to a sequence of min-ratio cycle problems. Solving this core primitive requires approximately minimizing the ratio of a linear gradient term and an undirected length term. In Chen-Kyng-Liu-Peng-Probst Gutenberg-Sachdeva (FOCS 2022) and the subsequent work of Chen-Kyng-Liu-Meierhans-Probst Gutenberg (STOC 2024), intricate data structures were given to solve the min-ratio problem.
We show that such a cycle can be extracted directly from the dynamic distance oracle of Kyng-Meierhans-Probst Gutenberg (STOC 2024) using linearity. This simplifies previous algorithms that relied on multiple additional steps to extract the cycle, and can be seen as evidence that solving the min-ratio cycle problem really is all about distances. As a result, we obtain a faster primal maxflow and min-cost flow solver that also extends to incremental graphs.
Innovation
Methods, ideas, or system contributions that make the work stand out.
min-ratio cycles
distance oracles
faster min-cost flow solver
incremental graphs
๐ Similar Papers
No similar papers found.
