{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:14Z","timestamp":1759638614437,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T00:00:00Z","timestamp":1596153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,31]]},"DOI":"10.1145\/3382734.3405719","type":"proceedings-article","created":{"date-parts":[[2020,7,31]],"date-time":"2020-07-31T22:33:55Z","timestamp":1596234835000},"page":"109-118","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Computing Shortest Paths and Diameter in the Hybrid Network Model"],"prefix":"10.1145","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[{"name":"University of Freiburg"}]},{"given":"Philipp","family":"Schneider","sequence":"additional","affiliation":[{"name":"University of Freiburg"}]}],"member":"320","published-online":{"date-parts":[[2020,7,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212773"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323195"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.78"},{"volume-title":"Proc. 30th Symp. on Found. of Computer Science (FOCS). 364--369","author":"Awerbuch B.","key":"e_1_3_2_1_4_1","unstructured":"B. Awerbuch , A. V. Goldberg , M. Luby , and S. A. Plotkin . 1989. Network Decomposition and Locality in Distributed Computation . In Proc. 30th Symp. on Found. of Computer Science (FOCS). 364--369 . B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. 1989. Network Decomposition and Locality in Distributed Computation. In Proc. 30th Symp. on Found. of Computer Science (FOCS). 364--369."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. 31st Int. Symp. on Distributed Computing (DISC). 7:1--7:16","author":"Becker Ruben","year":"2017","unstructured":"Ruben Becker , Andreas Karrenbauer , Sebastian Krinninger , and Christoph Lenzen . 2017 . Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models . In Proc. 31st Int. Symp. on Distributed Computing (DISC). 7:1--7:16 . Ruben Becker, Andreas Karrenbauer, Sebastian Krinninger, and Christoph Lenzen. 2017. Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models. In Proc. 31st Int. Symp. on Distributed Computing (DISC). 7:1--7:16."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316326"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331633"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0270-2"},{"key":"e_1_3_2_1_9_1","volume-title":"Proc. 22nd Int. Conf. on Principles of Distributed Systems (OPODIS). 4:1--4:17","author":"Censor-Hillel Keren","year":"2018","unstructured":"Keren Censor-Hillel , Dean Leitersdorf , and Elia Turner . 2018 . Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model . In Proc. 22nd Int. Conf. on Principles of Distributed Systems (OPODIS). 4:1--4:17 . Keren Censor-Hillel, Dean Leitersdorf, and Elia Turner. 2018. Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model. In Proc. 22nd Int. Conf. on Principles of Distributed Systems (OPODIS). 4:1--4:17."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851223"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_13_1","first-page":"1","article-title":"Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proc. 44th","volume":"137","author":"Gmyr Robert","year":"2017","unstructured":"Robert Gmyr , Kristian Hinnenthal , Christian Scheideler , and Christian Sohler . 2017 . Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proc. 44th Int. Coll. on Automata, Languages, and Programming (ICALP). 137 : 1 -- 137 :15. Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. 2017. Distributed Monitoring of Network Properties: The Power of Hybrid Networks. In Proc. 44th Int. Coll. on Automata, Languages, and Programming (ICALP). 137:1--137:15.","journal-title":"Int. Coll. on Automata, Languages, and Programming (ICALP)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018442"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_16_1","volume-title":"Proc. 28th Int. Symp. on Distributed Computing (DISC). 562--564","author":"Holzer Stephan","year":"2014","unstructured":"Stephan Holzer , David Peleg , Liam Roditty , and Roger Wattenhofer . 2014 . Brief Announcement: Distributed 3\/2-Approximation of the Diameter . In Proc. 28th Int. Symp. on Distributed Computing (DISC). 562--564 . Stephan Holzer, David Peleg, Liam Roditty, and Roger Wattenhofer. 2014. Brief Announcement: Distributed 3\/2-Approximation of the Diameter. In Proc. 28th Int. Symp. on Distributed Computing (DISC). 562--564."},{"key":"e_1_3_2_1_17_1","volume-title":"Proc. 19th Int. Conf. on Principles of Distributed Systems (OPODIS). 1--16","author":"Holzer Stephan","year":"2016","unstructured":"Stephan Holzer and Nathan Pinsker . 2016 . Approximation of Distances and Shortest Paths in the Broadcast Congest Clique . In Proc. 19th Int. Conf. on Principles of Distributed Systems (OPODIS). 1--16 . Stephan Holzer and Nathan Pinsker. 2016. Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In Proc. 19th Int. Conf. on Principles of Distributed Systems (OPODIS). 1--16."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_1_19_1","volume-title":"58th IEEE Symposium on Foundations of Computer Science (FOCS). 168--179","author":"Huang Chien-Chung","year":"2017","unstructured":"Chien-Chung Huang , Danupon Nanongkai , and Thatchaphol Saranurak . 2017 . Distributed Exact Weighted All-Pairs Shortest Paths in \u00d5(n5\/4) Rounds . In 58th IEEE Symposium on Foundations of Computer Science (FOCS). 168--179 . Chien-Chung Huang, Danupon Nanongkai, and Thatchaphol Saranurak. 2017. Distributed Exact Weighted All-Pairs Shortest Paths in \u00d5(n5\/4) Rounds. In 58th IEEE Symposium on Foundations of Computer Science (FOCS). 168--179."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.icte.2017.08.002"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01325-7_19"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Fabian Kuhn and Philipp Schneider. 2020. Computing Shortest Paths and Diameter in the Hybrid Network Model. arXiv:cs.DC\/2006.08408  Fabian Kuhn and Philipp Schneider. 2020. Computing Shortest Paths and Diameter in the Hybrid Network Model. arXiv:cs.DC\/2006.08408","DOI":"10.1145\/3382734.3405719"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488656"},{"key":"e_1_3_2_1_26_1","volume-title":"Fast Partial Distance Estimation and Applications. In 2015 ACM Symposium on Principles of Distributed Computing (PODC). 153--162","author":"Lenzen Christoph","year":"2015","unstructured":"Christoph Lenzen and Boaz Patt-Shamir . 2015 . Fast Partial Distance Estimation and Applications. In 2015 ACM Symposium on Principles of Distributed Computing (PODC). 153--162 . Christoph Lenzen and Boaz Patt-Shamir. 2015. Fast Partial Distance Estimation and Applications. In 2015 ACM Symposium on Principles of Distributed Computing (PODC). 153--162."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484262"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221015"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_58"},{"key":"e_1_3_2_1_32_1","volume-title":"A Survey on Automatic Configuration of Virtual Private Networks. Computer Networks 55, 8","author":"Rossberg Michael","year":"2011","unstructured":"Michael Rossberg and Guenter Schaefer . 2011. A Survey on Automatic Configuration of Virtual Private Networks. Computer Networks 55, 8 ( 2011 ). Michael Rossberg and Guenter Schaefer. 2011. A Survey on Automatic Configuration of Virtual Private Networks. Computer Networks 55, 8 (2011)."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_34_1","volume-title":"SD-WAN: A Modern Hybrid-WAN to Enable Digital Transformation for Businesses. IDC White Paper (April","author":"Tell Anis","year":"2018","unstructured":"Anis Tell , Wale Babalola , George Kalebiala , and Krishna Chinta . 2018. SD-WAN: A Modern Hybrid-WAN to Enable Digital Transformation for Businesses. IDC White Paper (April 2018 ). Anis Tell, Wale Babalola, George Kalebiala, and Krishna Chinta. 2018. SD-WAN: A Modern Hybrid-WAN to Enable Digital Transformation for Businesses. IDC White Paper (April 2018)."},{"key":"e_1_3_2_1_35_1","first-page":"100","article-title":"High-Probability Parallel Transitive-Closure Algorithms","volume":"20","author":"Ullman Jeffrey D.","year":"1991","unstructured":"Jeffrey D. Ullman and Mihalis Yannakakis . 1991 . High-Probability Parallel Transitive-Closure Algorithms . Journal on Computing 20 , 1 (1991), 100 -- 125 . Jeffrey D. Ullman and Mihalis Yannakakis. 1991. High-Probability Parallel Transitive-Closure Algorithms. Journal on Computing 20, 1 (1991), 100--125.","journal-title":"Journal on Computing"}],"event":{"name":"PODC '20: 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 '20"},"container-title":["Proceedings of the 39th Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405719","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3382734.3405719","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:49Z","timestamp":1750197769000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3382734.3405719"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,31]]},"references-count":35,"alternative-id":["10.1145\/3382734.3405719","10.1145\/3382734"],"URL":"https:\/\/doi.org\/10.1145\/3382734.3405719","relation":{},"subject":[],"published":{"date-parts":[[2020,7,31]]},"assertion":[{"value":"2020-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}