Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

Author:

Dou Jinfeng1ORCID,Götte Thorsten1ORCID,Hillebrandt Henning1ORCID,Scheideler Christian1ORCID,Werthmann Julian1ORCID

Affiliation:

1. Paderborn University, Paderborn, Germany

Funder

German Research Foundation

China Scholarship Council

Publisher

ACM

Reference22 articles.

1. Compact Routing for Graphs Excluding a Fixed Minor

2. Ittai Abraham and Dahlia Malkhi . 2004 . Compact routing on euclidian metrics . In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04 . ACM Press, St. John's, Newfoundland, Canada, 141. 10.1145/1011767.1011789 Ittai Abraham and Dahlia Malkhi. 2004. Compact routing on euclidian metrics. In Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing - PODC '04. ACM Press, St. John's, Newfoundland, Canada, 141. 10.1145/1011767.1011789

3. Ruben Becker , Yuval Emek , and Christoph Lenzen . 2020 . Low Diameter Graph Decompositions by Approximate Distance Computation . In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020 , January 12 --14 , 2020, Seattle, Washington, USA (LIPIcs, Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 50:1--50:29. 10.4230/LIPIcs.ITCS.2020.50 Ruben Becker, Yuval Emek, and Christoph Lenzen. 2020. Low Diameter Graph Decompositions by Approximate Distance Computation. In 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12--14, 2020, Seattle, Washington, USA (LIPIcs, Vol. 151), Thomas Vidick (Ed.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 50:1--50:29. 10.4230/LIPIcs.ITCS.2020.50

4. Jannik Castenow Christina Kolb and Christian Scheideler. 2019. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. http://arxiv.org/abs/1810.05453 arXiv:1810.05453 [cs]. Jannik Castenow Christina Kolb and Christian Scheideler. 2019. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. http://arxiv.org/abs/1810.05453 arXiv:1810.05453 [cs].

5. Jannik Castenow , Christina Kolb , and Christian Scheideler . 2020 . A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks . In ICDCN 2020: 21st International Conference on Distributed Computing and Networking , Kolkata, India, January 4--7 , 2020, Nandini Mukherjee and Sriram V. Pemmaraju (Eds.). ACM, 14:1--14:10. 10.1145/3369740.3369777 Jannik Castenow, Christina Kolb, and Christian Scheideler. 2020. A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks. In ICDCN 2020: 21st International Conference on Distributed Computing and Networking, Kolkata, India, January 4--7, 2020, Nandini Mukherjee and Sriram V. Pemmaraju (Eds.). ACM, 14:1--14:10. 10.1145/3369740.3369777

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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