{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:41:12Z","timestamp":1743068472575,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_14","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"317-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Routing Schemes for\u00a0Hybrid Communication Networks"],"prefix":"10.1007","author":[{"given":"Sam","family":"Coy","sequence":"first","affiliation":[]},{"given":"Artur","family":"Czumaj","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Scheideler","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Julian","family":"Werthmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Anagnostides, I., Gouleakis, T.: Deterministic distributed algorithms and lower bounds in the hybrid model. In: Gilbert, S. (ed.) 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 209, pp. 5:1\u20135:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.5. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/14807","key":"14_CR1","DOI":"10.4230\/LIPIcs.DISC.2021.5"},{"doi-asserted-by":"publisher","unstructured":"Asadi, A., Mancuso, V., Gupta, R.: An SDR-based experimental study of outband D2D communications. In: The 35th Annual IEEE International Conference on Computer Communications, IEEE INFOCOM 2016, pp. 1\u20139 (2016). https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524372","key":"14_CR2","DOI":"10.1109\/INFOCOM.2016.7524372"},{"doi-asserted-by":"crossref","unstructured":"Augustine, J., Hinnenthal, K., Kuhn, F., Scheideler, C., Schneider, P.: Shortest paths in a hybrid network model. In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, USA, pp. 1280\u20131299. Society for Industrial and Applied Mathematics (2020)","key":"14_CR3","DOI":"10.1137\/1.9781611975994.78"},{"issue":"6","key":"14_CR4","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1023\/A:1012319418150","volume":"7","author":"P Bose","year":"2001","unstructured":"Bose, P., Morin, P., Stojmenovic, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7(6), 609\u2013616 (2001). https:\/\/doi.org\/10.1023\/A:1012319418150","journal-title":"Wirel. Netw."},{"doi-asserted-by":"publisher","unstructured":"Castenow, J., Kolb, C., Scheideler, C.: A bounding box overlay for competitive routing in hybrid communication networks. In: Proceedings of the 21st International Conference on Distributed Computing and Networking (ICDCN 2020), pp. 14:1\u201314:10 (2020). https:\/\/doi.org\/10.1145\/3369740.3369777","key":"14_CR5","DOI":"10.1145\/3369740.3369777"},{"doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Leitersdorf, D., Polosukhin, V.: Distance computations in the hybrid network model via oracle simulations. In: Bl\u00e4ser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 187, pp. 21:1\u201321:19. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2021.21. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2021\/13666","key":"14_CR6","DOI":"10.4230\/LIPIcs.STACS.2021.21"},{"doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Leitersdorf, D., Polosukhin, V.: On sparsity awareness in distributed computations. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2021, pp. 151\u2013161. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3409964.3461798","key":"14_CR7","DOI":"10.1145\/3409964.3461798"},{"doi-asserted-by":"publisher","unstructured":"Coy, S., et al.: Near-shortest path routing in hybrid communication networks. In: Bramas, Q., Gramoli, V., Milani, A. (eds.) 25th International Conference on Principles of Distributed Systems (OPODIS 2021). Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, vol. 217, pp. 11:1\u201311:23. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2021.11. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15786","key":"14_CR8","DOI":"10.4230\/LIPIcs.OPODIS.2021.11"},{"doi-asserted-by":"crossref","unstructured":"Elkin, M., Neiman, O.: On efficient distributed construction of near optimal routing schemes. In: Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pp. 235\u2013244 (2016)","key":"14_CR9","DOI":"10.1145\/2933057.2933098"},{"doi-asserted-by":"publisher","unstructured":"Feldmann, M., Hinnenthal, K., Scheideler, C.: Fast hybrid network algorithms for shortest paths in sparse graphs. In: Proceedings of the 24th International Conference on Principles of Distributed Systems (OPODIS 2020), pp. 31:1\u201331:16 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020.31","key":"14_CR10","DOI":"10.4230\/LIPIcs.OPODIS.2020.31"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Schneider, P.: Computing shortest paths and diameter in the hybrid network model. In: Proceedings of the 39th Symposium on Principles of Distributed Computing, PODC 2020, pp. 109\u2013118. Association for Computing Machinery, New York (2020). https:\/\/doi.org\/10.1145\/3382734.3405719","key":"14_CR11","DOI":"10.1145\/3382734.3405719"},{"unstructured":"Kuhn, F., Schneider, P.: Routing schemes and distance oracles in the hybrid model. In: International Symposium on Distributed Computing (DISC), vol. 246, pp. 28:1\u201328:22 (2022)","key":"14_CR12"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Wattenhofer, R, Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 63\u201372 (2003). https:\/\/doi.org\/10.1145\/872035.872044","key":"14_CR13","DOI":"10.1145\/872035.872044"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2002), pp. 24\u201333 (2002). https:\/\/doi.org\/10.1145\/570810.570814","key":"14_CR14","DOI":"10.1145\/570810.570814"},{"doi-asserted-by":"publisher","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-case optimal and average-case efficient geometric ad-hoc routing. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 267\u2013278 (2003). https:\/\/doi.org\/10.1145\/778415.778447","key":"14_CR15","DOI":"10.1145\/778415.778447"},{"doi-asserted-by":"publisher","unstructured":"Lenzen, C., Patt-Shamir, B.: Fast routing table construction using small messages: extended abstract. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2013, pp. 381\u2013390. Association for Computing Machinery, New York (2013). https:\/\/doi.org\/10.1145\/2488608.2488656","key":"14_CR16","DOI":"10.1145\/2488608.2488656"},{"doi-asserted-by":"crossref","unstructured":"Lenzen, C., Patt-Shamir, B.: Fast partial distance estimation and applications. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 153\u2013162 (2015)","key":"14_CR17","DOI":"10.1145\/2767386.2767398"},{"unstructured":"Lynch, N.A.: Distributed Algorithms. Elsevier (1996)","key":"14_CR18"},{"doi-asserted-by":"crossref","unstructured":"Rozho\u0148, V., Grunau, C., Haeupler, B., Zuzic, G., Li, J.: Undirected (1+$$\\varepsilon $$)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In: Symposium on Theory of Computing, pp. 478\u2013487 (2022)","key":"14_CR19","DOI":"10.1145\/3519935.3520074"},{"issue":"5","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1137\/11085178X","volume":"41","author":"AD Sarma","year":"2012","unstructured":"Sarma, A.D., et al.: Distributed verification and hardness of distributed approximation. SIAM J. Comput. 41(5), 1235\u20131265 (2012)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Schneider, P.: Power and limitations of Hybrid communication networks. Ph.D. thesis, University of Freiburg (2023). https:\/\/doi.org\/10.6094\/UNIFR\/232804","key":"14_CR21","DOI":"10.6094\/UNIFR\/232804"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:06:10Z","timestamp":1684969570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}