{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:19:42Z","timestamp":1750220382676,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Research Council (ERC) Grant","award":["949083"],"award-info":[{"award-number":["949083"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467927","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"203-211","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Low-Congestion Shortcuts in Constant Diameter Graphs"],"prefix":"10.1145","author":[{"given":"Shimon","family":"Kogan","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"given":"Merav","family":"Parter","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Diameter of the world-wide web. nature 401, 6749","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert , Hawoong Jeong , and Albert-L\u00e1szl\u00f3 Barab\u00e1si . 1999. Diameter of the world-wide web. nature 401, 6749 ( 1999 ), 130--131. R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Diameter of the world-wide web. nature 401, 6749 (1999), 130--131."},{"key":"e_1_3_2_2_2_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 33:1--33:18","author":"Chuzhoy Julia","year":"2020","unstructured":"Julia Chuzhoy , Merav Parter , and Zihan Tan . 2020 . On Packing Low- Diameter Spanning Trees. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 33:1--33:18 . Julia Chuzhoy, Merav Parter, and Zihan Tan. 2020. On Packing Low- Diameter Spanning Trees. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbr\u00fccken, Germany (Virtual Conference). 33:1--33:18."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331617"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007407"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767417"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"e_1_3_2_2_8_1","volume-title":"Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR abs\/2008.03091","author":"Ghaffari Mohsen","year":"2020","unstructured":"Mohsen Ghaffari and Bernhard Haeupler . 2020. Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR abs\/2008.03091 ( 2020 ). arXiv:2008.03091 https:\/\/arxiv.org\/abs\/2008.03091 Mohsen Ghaffari and Bernhard Haeupler. 2020. Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR abs\/2008.03091 (2020). arXiv:2008.03091 https:\/\/arxiv.org\/abs\/2008.03091"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087827"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933103"},{"key":"e_1_3_2_2_11_1","volume-title":"Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017","author":"Ghaffari Mohsen","year":"2017","unstructured":"Mohsen Ghaffari and Merav Parter . 2017 . Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017 , October 16 --20 , 2017, Vienna, Austria. 21:1--21:16. Mohsen Ghaffari and Merav Parter. 2017. Near-Optimal Distributed DFS in Planar Graphs. In 31st International Symposium on Distributed Computing, DISC 2017, October 16--20, 2017, Vienna, Austria. 21:1--21:16."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212737"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933112"},{"key":"e_1_3_2_2_14_1","volume-title":"32nd International Symposium on Distributed Computing, DISC 2018","author":"Haeupler Bernhard","year":"2018","unstructured":"Bernhard Haeupler and Jason Li . 2018 . Faster Distributed Shortest Path Approximations via Shortcuts . In 32nd International Symposium on Distributed Computing, DISC 2018 , New Orleans, LA, USA , October 15-19, 2018. 33:1--33:14. Bernhard Haeupler and Jason Li. 2018. Faster Distributed Shortest Path Approximations via Shortcuts. In 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018. 33:1--33:14."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212776"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175472"},{"key":"e_1_3_2_2_18_1","volume-title":"Low-Congestion Shortcut and Graph Parameters. In 33rd International Symposium on Distributed Computing, DISC 2019","volume":"17","author":"Kitamura Naoki","year":"2019","unstructured":"Naoki Kitamura , Hirotaka Kitagawa , Yota Otachi , and Taisuke Izumi . 2019 . Low-Congestion Shortcut and Graph Parameters. In 33rd International Symposium on Distributed Computing, DISC 2019 , October 14-18, 2019, Budapest, Hungary (LIPIcs , Vol. 146), Jukka Suomela (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 25:1--25: 17 . Naoki Kitamura, Hirotaka Kitagawa, Yota Otachi, and Taisuke Izumi. 2019. Low-Congestion Shortcut and Graph Parameters. In 33rd International Symposium on Distributed Computing, DISC 2019, October 14-18, 2019, Budapest, Hungary (LIPIcs, Vol. 146), Jukka Suomela (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 25:1--25:17."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050061"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316358"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383984"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0127-6"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777428"},{"key":"e_1_3_2_2_24_1","volume-title":"A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. CoRR abs\/1912.04239","author":"Nowicki Krzysztof","year":"2019","unstructured":"Krzysztof Nowicki . 2019. A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. CoRR abs\/1912.04239 ( 2019 ). arXiv:1912.04239 http:\/\/arxiv.org\/abs\/1912.04239 Krzysztof Nowicki. 2019. A Deterministic Algorithm for the MST Problem in Constant Rounds of Congested Clique. CoRR abs\/1912.04239 (2019). arXiv:1912.04239 http:\/\/arxiv.org\/abs\/1912.04239"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_2_26_1","volume-title":"Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011","author":"Sarma Atish Das","year":"2011","unstructured":"Atish Das Sarma , Stephan Holzer , Liah Kor , Amos Korman , Danupon Nanongkai , Gopal Pandurangan , David Peleg , and Roger Wattenhofer . 2011 . Distributed verification and hardness of distributed approximation . In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011 , San Jose, CA, USA , 6-8 June 2011. 363--372. Atish Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2011. Distributed verification and hardness of distributed approximation. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011. 363--372."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467927","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:25Z","timestamp":1750191505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":26,"alternative-id":["10.1145\/3465084.3467927","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467927","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}