Faster Sparse Minimum Cost Flow by Electrical Flow Localization

2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)(2021)

引用 25|浏览23
暂无评分
摘要
We give an $\tilde{O}(m^{3/2-1/762}\log(U+W))$ time algorithm for minimum cost flow with capacities bounded by $U$ and costs bounded by $W$. For sparse graphs with general capacities, this is the first algorithm to improve over the $\tilde{O}(m^{3/2}\log^{O(1)}(U+W))$ running time obtained by an appropriate instantiation of an interior point method [Dait...
更多
查看译文
关键词
Resistance,Measurement,Location awareness,Computer science,Costs,Machinery,Optimization
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络