Dynamic Maxflow via Dynamic Interior Point Methods-Reference-Cited by-同舟云学术

Dynamic Maxflow via Dynamic Interior Point Methods

Published:2023-06-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 55th Annual ACM Symposium on Theory of Computing
language:
Short-container-title:

Author:

van den Brand Jan¹,Liu Yang P.²,Sidford Aaron²

Affiliation:

1. Georgia Institute of Technology, USA

2. Stanford University, USA

Funder

NSF (National Science Foundation)

Publisher

ACM

Link

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

Reference90 articles.

1. Amir Abboud and Søren Dahlgaard . 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms . In FOCS. IEEE Computer Society , 477–486. Amir Abboud and Søren Dahlgaard. 2016. Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. In FOCS. IEEE Computer Society, 477–486.

2. Amir Abboud and Virginia Vassilevska Williams . 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems . In FOCS. IEEE Computer Society , 434–443. Amir Abboud and Virginia Vassilevska Williams. 2014. Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. In FOCS. IEEE Computer Society, 434–443.

3. Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms. In ICALP (LIPIcs, Vol. 107);Arar Moab;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2018

4. Sepehr Assadi , Soheil Behnezhad , Sanjeev Khanna , and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs/2207.09354 ( 2022 ). Sepehr Assadi, Soheil Behnezhad, Sanjeev Khanna, and Huan Li. 2022. On Regularity Lemma and Barriers in Streaming and Dynamic Matching. CoRR, abs/2207.09354 (2022).

5. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs

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

1. 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

2. 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

3. Approximating Edit Distance in the Fully Dynamic Model;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06