Faster maxflow via improved dynamic spectral vertex sparsifiers-Reference-Cited by-同舟云学术

Faster maxflow via improved dynamic spectral vertex sparsifiers

Published:2022-06-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

van den Brand Jan¹,Gao Yu²,Jambulapati Arun³,Lee Yin Tat⁴,Liu Yang P.³,Peng Richard²,Sidford Aaron³

Affiliation:

1. Simons Institute for the Theory of Computing Berkeley, USA / University of California at Berkeley, USA

2. Georgia Institute of Technology, USA

3. Stanford University, USA

4. University of Washington, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3519935.3520068

Reference75 articles.

1. Iterative Refinement for ℓp-norm Regression

2. Hilal Asi , Yair Carmon , Arun Jambulapati , Yujia Jin , and Aaron Sidford . 2021. Stochastic Bias-Reduced Gradient Methods. Advances in Neural Information Processing Systems, 34 ( 2021 ). Hilal Asi, Yair Carmon, Arun Jambulapati, Yujia Jin, and Aaron Sidford. 2021. Stochastic Bias-Reduced Gradient Methods. Advances in Neural Information Processing Systems, 34 (2021).

3. Kyriakos Axiotis , Aleksander Madry , and Adrian Vladu . 2020. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs . In FOCS. IEEE , 93–104. Available at: arxiv:2111.10368v1 Kyriakos Axiotis, Aleksander Madry, and Adrian Vladu. 2020. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. In FOCS. IEEE, 93–104. Available at: arxiv:2111.10368v1

4. Kyriakos Axiotis , Aleksander Mądry , and Adrian Vladu . 2021. Faster Sparse Minimum Cost Flow by Electrical Flow Localization . In FOCS. IEEE. Kyriakos Axiotis, Aleksander Mądry, and Adrian Vladu. 2021. Faster Sparse Minimum Cost Flow by Electrical Flow Localization. In FOCS. IEEE.

5. Amos Beimel , Haim Kaplan , Yishay Mansour , Kobbi Nissim , Thatchaphol Saranurak , and Uri Stemmer . 2021. Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR, abs/2111.03980 ( 2021 ). Amos Beimel, Haim Kaplan, Yishay Mansour, Kobbi Nissim, Thatchaphol Saranurak, and Uri Stemmer. 2021. Dynamic Algorithms Against an Adaptive Adversary: Generic Constructions and Lower Bounds. CoRR, abs/2111.03980 (2021).

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

1. Fast Computation for the Forest Matrix of an Evolving Graph;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow;Communications of the ACM;2023-11-17

3. Singular Value Approximation and Sparsifying Random Walks on Directed Graphs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

5. Faster High Accuracy Multi-Commodity Flow from Single-Commodity Techniques;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06