On efficient distributed construction of near optimal routing schemes-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On efficient distributed construction of near optimal routing schemes

Published:2017-06-01 Issue:2 Volume:31 Page:119-137
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Elkin Michael,Neiman Ofer

Funder

Israel Science Foundation

United States - Israel Binational Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00446-017-0304-4/fulltext.html

Reference34 articles.

1. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms 11(3), 307–341 (1990)

2. Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: Distributed Computing, 18th International Conference, DISC 2004, Amsterdam, The Netherlands, October 4–7, 2004, Proceedings, pp. 305–319 (2004)

3. Bernstein, A.: Fully dynamic (2 + epsilon) approximate all-pairs shortest paths with fast query and close to linear update time. In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25–27, 2009, Atlanta, Georgia, USA, pp. 693–702 (2009)

4. Chechik, S.: Compact routing schemes with improved stretch. In: ACM Symposium on Principles of Distributed Computing, PODC ’13, Montreal, QC, Canada, July 22–24, 2013, pp. 33–41 (2013)

5. Cohen, E.: Polylog-time and near-linear work approximation scheme for undirected shortest paths. J. ACM 47(1), 132–166 (2000)

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

1. Improved weighted additive spanners;Distributed Computing;2022-08-04

2. Minor Sparsifiers and the Distributed Laplacian Paradigm;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

3. Fully Compact Routing in Low Memory Self-Healing Trees;Proceedings of the 21st International Conference on Distributed Computing and Networking;2020-01-04

4. A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths;SIAM Journal on Computing;2019-10-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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