Parallel approximate undirected shortest paths via low hop emulators
Author:
Affiliation:
1. Columbia University, USA
Funder
National Science Foundation
Google
Simons Foundation
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3357713.3384321
Reference61 articles.
1. A hierarchy of lower bounds for sublinear additive spanners;Abboud Amir;SIAM J. Comput.,2018
2. Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. https://doi.org/10.1145/2591796.2591805 Full version at 10.1145/2591796.2591805 Alexandr Andoni Aleksandar Nikolov Krzysztof Onak and Grigory Yaroslavtsev. 2014. Parallel algorithms for geometric graph problems. https://doi.org/10.1145/2591796.2591805 Full version at 10.1145/2591796.2591805
3. Alexandr Andoni Clifford Stein and Peilin Zhong. 2019. Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators. arXiv preprint arXiv:1911.01956. Alexandr Andoni Clifford Stein and Peilin Zhong. 2019. Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators. arXiv preprint arXiv:1911.01956.
4. The multiplicative weights update method: a meta-algorithm and applications;Arora Sanjeev;Theory of Computing,2012
Cited by 32 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Massively Parallel Algorithms for Approximate Shortest Paths;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
2. A Simpler and Parallelizable O(√log n)-approximation Algorithm for Sparsest Cut;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17
3. Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping;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. Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3