Maximum Flow and Minimum-Cost Flow in Almost-Linear Time-Reference-Cited by-同舟云学术

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Chen Li¹,Kyng Rasmus²,Liu Yang P.³,Peng Richard⁴,Gutenberg Maximilian Probst²,Sachdeva Sushant⁵

Affiliation:

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

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

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

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

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

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

IEEE

Link

Reference46 articles.

1. Bipartite matching in nearly-linear time on moderately dense graphs;brand;FOCS86,2020

2. Tutorial on the Robust Interior Point Method;lee;arXiv preprint arXiv 2108 03490,2021

5. 2-norm Flow Diffusion in Near-Linear Time;chen;FOCS86,2021

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

2. Expander Hierarchies for Normalized Cuts on Graphs;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. Max-Min Diversification with Asymmetric Distances;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24