{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:21:07Z","timestamp":1758266467032,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T00:00:00Z","timestamp":1307836800000},"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":[[2011,6,12]]},"DOI":"10.1145\/1989323.1989368","type":"proceedings-article","created":{"date-parts":[[2011,6,14]],"date-time":"2011-06-14T14:45:32Z","timestamp":1308062732000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":30,"title":["On k-skip shortest paths"],"prefix":"10.1145","author":[{"given":"Yufei","family":"Tao","sequence":"first","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Cheng","family":"Sheng","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, Canada"}]}],"member":"320","published-online":{"date-parts":[[2011,6,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873665"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.277767"},{"key":"e_1_3_2_1_3_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms , Second Edition. The MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0115-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/364520.364540"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216064"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788888.1788912"},{"key":"e_1_3_2_1_9_1","first-page":"156","volume-title":"Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: $A^*$ search meets graph theory . In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: $A^*$ search meets graph theory. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 156--165, 2005."},{"key":"e_1_3_2_1_10_1","first-page":"38","volume-title":"Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Goldberg A. V.","year":"2006","unstructured":"A. V. Goldberg , H. Kaplan , and R. F. Werneck . Reach for A*: Shortest path algorithms with preprocessing . In Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX) , pages 38 -- 51 , 2006 . A. V. Goldberg, H. Kaplan, and R. F. Werneck. Reach for A*: Shortest path algorithms with preprocessing. In Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX), pages 38--51, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871503"},{"key":"e_1_3_2_1_12_1","first-page":"100","volume-title":"Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX)","author":"Gutman R. J.","year":"2004","unstructured":"R. J. Gutman . Reach-based routing : A new approach to shortest path algorithms optimized for road networks . In Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX) , pages 100 -- 111 , 2004 . R. J. Gutman. Reach-based routing: A new approach to shortest path algorithms optimized for road networks. In Proceedings of Workshop on Algorithm Engineering and Experiments (ALENEX), pages 100--111, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187876"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00217-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.687976"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1033772"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-005-4575-8"},{"key":"e_1_3_2_1_19_1","volume-title":"An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilitat - von der Forschung zur praktischen Anwendung, 22:219--230","author":"Lauther U.","year":"2004","unstructured":"U. Lauther . An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilitat - von der Forschung zur praktischen Anwendung, 22:219--230 , 2004 . U. Lauther. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation und Mobilitat - von der Forschung zur praktischen Anwendung, 22:219--230, 2004."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/9.3.275"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646063"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1921071.1921074"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90013-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376623"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687763"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064546.1103378"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807181"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516418"}],"event":{"name":"SIGMOD\/PODS '11: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Athens Greece","acronym":"SIGMOD\/PODS '11"},"container-title":["Proceedings of the 2011 ACM SIGMOD International Conference on Management of data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989368","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989323.1989368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:21Z","timestamp":1750245741000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989323.1989368"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,12]]},"references-count":30,"alternative-id":["10.1145\/1989323.1989368","10.1145\/1989323"],"URL":"https:\/\/doi.org\/10.1145\/1989323.1989368","relation":{},"subject":[],"published":{"date-parts":[[2011,6,12]]},"assertion":[{"value":"2011-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}