Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model

Author:

de Vos Tijn1ORCID

Affiliation:

1. University of Salzburg, Salzburg, Austria

Funder

Austrian Science Fund

European Research Council

Publisher

ACM

Reference35 articles.

1. Mohamad Ahmadi , Fabian Kuhn , and Rotem Oshman . 2018 . Distributed Approximate Maximum Matching in the CONGEST Model . In Proc. of the 32nd International Symposium on Distributed Computing, DISC 2018 (LIPIcs , Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6: 17 . Mohamad Ahmadi, Fabian Kuhn, and Rotem Oshman. 2018. Distributed Approximate Maximum Matching in the CONGEST Model. In Proc. of the 32nd International Symposium on Distributed Computing, DISC 2018 (LIPIcs, Vol. 121). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6:17.

2. Ioannis Anagnostides , Christoph Lenzen , Bernhard Haeupler , Goran Zuzic , and Themis Gouleakis . 2022 . Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts . In Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs , Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6: 20 . arXiv:2109.05151 Announced at PODC 2022. Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, and Themis Gouleakis. 2022. Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. In Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs, Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 6:1--6:20. arXiv:2109.05151 Announced at PODC 2022.

3. Alexandr Andoni , Clifford Stein , and Peilin Zhong . 2020 . Parallel approximate undirected shortest paths via low hop emulators . In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 322--335 . arXiv:1911.01956 Alexandr Andoni, Clifford Stein, and Peilin Zhong. 2020. Parallel approximate undirected shortest paths via low hop emulators. In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 322--335. arXiv:1911.01956

4. Kyriakos Axiotis , Aleksander Mądry , and Adrian Vladu . 2020 . Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs . In Proc. of the 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 93--104 . arXiv:2003.04863 Kyriakos Axiotis, Aleksander Mądry, and Adrian Vladu. 2020. Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs. In Proc. of the 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020. IEEE, 93--104. arXiv:2003.04863

5. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models;Becker Ruben;SIAM J. Comput.,2021

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3