A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow-Reference-Cited by-同舟云学术

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

Published:2023-11-06 Issue: Volume: Page:
ISSN:
Container-title:2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Brand Jan Van Den¹,Chen Li¹,Peng Richard²,Kyng Rasmus³,Liu Yang P.⁴,Gutenberg Maximilian Probst³,Sachdeva Sushant⁵,Sidford Aaron⁶

Affiliation:

1. School of Computer Science Georgia Tech,Atlanta,USA

2. University of Waterloo,School of Computer Science,Waterloo,Canada

3. ETH Zurich,Department of Computer Science,Zurich,Switzerland

4. Stanford University,Department of Mathematics,Palo Alto,USA

5. University of Toronto,Department of Computer Science,Toronto,Canada

6. Stanford University,Department of Management Science & Engineering and Department of Computer Science,Palo Alto,USA

Funder

Natural Sciences and Engineering Research Council of Canada

Microsoft Research

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/10353068/10353072/10353212.pdf?arnumber=10353212

Reference81 articles.

1. Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time

2. Subcubic algorithms for Gomory–Hu tree in unweighted graphs

3. Using Petal-Decompositions to Build a Low Stretch Spanning Tree

4. Efficient Flow-based Approximation Algorithms for Submodular Hypergraph Partitioning via a Generalized Cut-Matching Game;Ameranis;CoRR abs/2301.08920,2023

5. Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Operational Cost Models for an Earth Station System Using 2-Parallel and 4-Parallel Configurations;IIUM Engineering Journal;2024-07-14

2. Minimum Cut in $$O(m\log ^2 n)$$ Time;Theory of Computing Systems;2024-06-12

3. A Strongly Polynomial Algorithm for Linear Programs with At Most Two Nonzero Entries per Row or Column;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. A Dynamic Shortest Paths Toolbox: Low-Congestion Vertex Sparsifiers and Their Applications;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Almost-Linear Time Algorithms for Incremental Graphs: Cycle Detection, SCCs, s-t Shortest Path, and Minimum-Cost Flow;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10