{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:56Z","timestamp":1740109316234,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T00:00:00Z","timestamp":1655078400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["No.2020R1C1C1012742"],"award-info":[{"award-number":["No.2020R1C1C1012742"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s00453-022-00985-1","type":"journal-article","created":{"date-parts":[[2022,6,13]],"date-time":"2022-06-13T05:02:43Z","timestamp":1655096563000},"page":"2820-2841","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability Problems for Transmission Graphs"],"prefix":"10.1007","volume":"84","author":[{"given":"Shinwoo","family":"An","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0798-2580","authenticated-orcid":false,"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,13]]},"reference":[{"key":"985_CR1","doi-asserted-by":"crossref","unstructured":"Afshani, P., Chan, T.M.: Optimal halfspace range reporting in three dimensions. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 180\u2013186 (2009)","DOI":"10.1137\/1.9781611973068.21"},{"key":"985_CR2","unstructured":"Ashur, S., Carmi, P.: t-spanners for transmission graphs using the path-greedy algorithm. In: 36th European Workshop on Computational Geometry (EuroCG 2020), Book of Abstracts, pp. 60:1\u201360:6 (2020)"},{"issue":"4","key":"985_CR3","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.comgeo.2014.12.003","volume":"48","author":"S Cabello","year":"2015","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Shortest paths in intersection graphs of unit disks. Comput Geom. 48(4), 360\u2013367 (2015)","journal-title":"Comput Geom."},{"key":"985_CR4","unstructured":"Chan, T.M.: Dynamic geometric data structures via shallow cuttings. In: Proceedings of the 35th International Symposium on Computational Geometry (SoCG 2019), pp. 24:1\u201324:13 (2019)"},{"issue":"2","key":"985_CR5","first-page":"3","volume":"10","author":"TM Chan","year":"2019","unstructured":"Chan, T.M., Skrepetos, D.: Approximate shortest paths and distance oracles in weighted unit-disk graphs. J. Comput. Geom. 10(2), 3\u201320 (2019)","journal-title":"J. Comput. Geom."},{"key":"985_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"985_CR7","doi-asserted-by":"crossref","unstructured":"de\u00a0Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"985_CR8","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.aim.2008.06.002","volume":"219","author":"J Fox","year":"2008","unstructured":"Fox, J., Pach, J.: Separator theorems and tur\u00f3n-type results for planar intersection graphs. Adv. Math. 219, 1070\u20131080 (2008)","journal-title":"Adv. Math."},{"issue":"1","key":"985_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1328911.1328921","volume":"4","author":"J Gudmundsson","year":"2008","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric spanners. ACM Trans. Algorithms 4(1), 1\u201334 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"985_CR10","doi-asserted-by":"crossref","unstructured":"Holm, J., Rotenberg, E., Thorup, M.: Planar reachability in linear space and constant time. In: Proceedings of the 56th Annual Symposium on Foundations of Computer Science (FOCS 2015), pp. 370\u2013389 (2015)","DOI":"10.1109\/FOCS.2015.30"},{"issue":"1","key":"985_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1137\/0214006","volume":"14","author":"H Imai","year":"1985","unstructured":"Imai, H., Iri, M., Murota, K.: Voronoi diagram in the laguerre geometry and its applications. SIAM J. Comput. 14(1), 93\u2013105 (1985)","journal-title":"SIAM J. Comput."},{"key":"985_CR12","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Spanners and reachability oracles for directed transmission graphs. In: Proceedings of the 31st International Symposium on Computational Geometry (SoCG 2015), vol. 34, pp. 156\u2013170 (2015)"},{"issue":"3","key":"985_CR13","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1007\/s00453-017-0308-2","volume":"80","author":"H Kaplan","year":"2018","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Routing in unit disk graphs. Algorithmica 80(3), 830\u2013848 (2018)","journal-title":"Algorithmica"},{"issue":"4","key":"985_CR14","doi-asserted-by":"publisher","first-page":"1585","DOI":"10.1137\/16M1059692","volume":"47","author":"H Kaplan","year":"2018","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P.: Spanners for directed transmission graphs. SIAM J. Comput. 47(4), 1585\u20131609 (2018)","journal-title":"SIAM J. Comput."},{"key":"985_CR15","doi-asserted-by":"crossref","unstructured":"Kaplan, H., Mulzer, W., Roditty, L., Seiferth, P., Sharir, M.: Dynamic planar voronoi diagrams for general distance functions and their algorithmic applications. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 2495\u20132504 (2017)","DOI":"10.1137\/1.9781611974782.165"},{"key":"985_CR16","doi-asserted-by":"crossref","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Scandinavian Workshop on Algorithm Theory (SWAT 1988), pp. 208\u2013213 (1988)","DOI":"10.1007\/3-540-19487-8_23"},{"key":"985_CR17","doi-asserted-by":"crossref","unstructured":"Miller, G., Teng, S.H., Varasis, S.: A unified geometric approach to graph separators. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS 1991), pp. 538\u2013547 (1991)","DOI":"10.1109\/SFCS.1991.185417"},{"key":"985_CR18","unstructured":"Moidu, N., Agarwal, J., Kothapalli, K.: Planar convex hull range query and related problems. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG 2013) (2013)"},{"key":"985_CR19","unstructured":"Oh, E.: Shortest-path queries in geometric networks. In: Proceedings of the 31st International Symposium on Algorithms and Computation (ISAAC 2020), pp. 52:1\u201352:15 (2020)"},{"issue":"3","key":"985_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1807048.1807054","volume":"7","author":"D Peleg","year":"2010","unstructured":"Peleg, D., Roditty, L.: Localized spanner construction for ad hoc networks with variable transmission range. ACM Trans. Sens. Netw. 7(3), 1\u201314 (2010)","journal-title":"ACM Trans. Sens. Netw."},{"issue":"1","key":"985_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s00453-011-9580-8","volume":"65","author":"D Peleg","year":"2013","unstructured":"Peleg, D., Roditty, L.: Relaxed spanners for directed disk graphs. Algorithmica 65(1), 146\u2013158 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"985_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TNET.2008.926506","volume":"17","author":"P Von Rickenbach","year":"2009","unstructured":"Von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE\/ACM Trans. Network. 17(1), 172\u2013185 (2009)","journal-title":"IEEE\/ACM Trans. Network."},{"issue":"4","key":"985_CR23","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s00454-020-00219-7","volume":"64","author":"H Wang","year":"2020","unstructured":"Wang, H., Xue, J.: Near-optimal algorithms for shortest paths in weighted unit-disk graphs. Discrete Comput. Geom. 64(4), 1141\u20131166 (2020)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"985_CR24","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1137\/0211059","volume":"11","author":"ACC Yao","year":"1982","unstructured":"Yao, A.C.C.: On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM J. Comput. 11(4), 721\u2013736 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00985-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-022-00985-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-022-00985-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T20:58:54Z","timestamp":1727384334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-022-00985-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,13]]},"references-count":24,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["985"],"URL":"https:\/\/doi.org\/10.1007\/s00453-022-00985-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2022,6,13]]},"assertion":[{"value":"17 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}