{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:53:17Z","timestamp":1775638397774,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"publisher","award":["M4080094.020"],"award-info":[{"award-number":["M4080094.020"]}],"id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003395","name":"Shanghai Municipal Education Commission","doi-asserted-by":"publisher","award":["No.14JC1400300"],"award-info":[{"award-number":["No.14JC1400300"]}],"id":[{"id":"10.13039\/501100003395","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["ARC19\/14"],"award-info":[{"award-number":["ARC19\/14"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2749456","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"967-982","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":102,"title":["Efficient Route Planning on Public Transportation Networks"],"prefix":"10.1145","author":[{"given":"Sibo","family":"Wang","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Wenqing","family":"Lin","sequence":"additional","affiliation":[{"name":"A*STAR, Singapore, Singapore"}]},{"given":"Yi","family":"Yang","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]},{"given":"Xiaokui","family":"Xiao","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"https:\/\/code.google.com\/p\/googletransitdatafeed\/wiki\/PublicFeeds.  https:\/\/code.google.com\/p\/googletransitdatafeed\/wiki\/PublicFeeds."},{"key":"e_1_3_2_1_2_1","unstructured":"https:\/\/sites.google.com\/site\/timetablelabelling\/.  https:\/\/sites.google.com\/site\/timetablelabelling\/."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33090-2_4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888935.1888969"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_15"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20382"},{"key":"e_1_3_2_1_9_1","first-page":"937","volume-title":"SODA","author":"Cohen E.","year":"2002","unstructured":"E. Cohen , E. Halperin , H. Kaplan , and U. Zwick . Reachability and distance queries via 2-hop labels . In SODA , pages 937 -- 946 , 2002 . E. Cohen, E. Halperin, H. Kaplan, and U. Zwick. Reachability and distance queries via 2-hop labels. In SODA, pages 937--946, 2002."},{"key":"e_1_3_2_1_10_1","volume-title":"The shortest route through a network with time-dependent internodal transit times. Journal of mathematical analysis and applications, 14(3):493--498","author":"Cooke K. L.","year":"1966","unstructured":"K. L. Cooke and E. Halsey . The shortest route through a network with time-dependent internodal transit times. Journal of mathematical analysis and applications, 14(3):493--498 , 1966 . K. L. Cooke and E. Halsey. The shortest route through a network with time-dependent internodal transit times. Journal of mathematical analysis and applications, 14(3):493--498, 1966."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9341-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2345678"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_71"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972924.13"},{"key":"e_1_3_2_1_16_1","first-page":"43","article-title":"Intriguingly simple and fast transit routing","volume":"7933","author":"Dibbelt J.","year":"2013","unstructured":"J. Dibbelt , T. Pajor , B. Strasser , and D. Wagner . Intriguingly simple and fast transit routing . SEA , 7933 : 43 -- 54 , 2013 . J. Dibbelt, T. Pajor, B. Strasser, and D. Wagner. Intriguingly simple and fast transit routing. SEA, 7933:43--54, 2013.","journal-title":"SEA"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_18_1","first-page":"347","volume-title":"SEA","author":"Disser Y.","year":"2008","unstructured":"Y. Disser , M. M\u00fcller-Hannemann , and M. Schnee . Multi-criteria shortest paths in time-dependent train networks . In SEA , pages 347 -- 361 , 2008 . Y. Disser, M. M\u00fcller-Hannemann, and M. Schnee. Multi-criteria shortest paths in time-dependent train networks. In SEA, pages 347--361, 2008."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.17.3.395"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9714-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13193-6_7"},{"key":"e_1_3_2_1_22_1","first-page":"156","volume-title":"SODA","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: phA search meets graph theory . In SODA , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: phA search meets graph theory. In SODA, pages 156--165, 2005."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791171.2791184"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/074\/03"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316756"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.71"},{"key":"e_1_3_2_1_27_1","first-page":"219","article-title":"An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background","volume":"22","author":"Lauther U.","year":"2004","unstructured":"U. Lauther . An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background . Geoinformation , 22 : 219 -- 230 , 2004 . U. Lauther. An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. Geoinformation, 22:219--230, 2004.","journal-title":"Geoinformation"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427186_18"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.058"},{"key":"e_1_3_2_1_30_1","volume-title":"ATMOS","author":"M\u00fcller-Hannemann M.","year":"2005","unstructured":"M. M\u00fcller-Hannemann and M. Schnee . Paying less for train connections with MOTIS . In ATMOS , 2005 . M. M\u00fcller-Hannemann and M. Schnee. Paying less for train connections with MOTIS. In ATMOS, 2005."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05465-5_10"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1961366.1961370"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)E0349-G"},{"key":"e_1_3_2_1_34_1","first-page":"334","volume-title":"SEA","author":"Nannicini G.","year":"2008","unstructured":"G. Nannicini , D. Delling , L. Liberti , and D. Schultes . Bidirectional a search for time-dependent fast paths . In SEA , pages 334 -- 346 , 2008 . G. Nannicini, D. Delling, L. Liberti, and D. Schultes. Bidirectional a search for time-dependent fast paths. In SEA, pages 334--346, 2008."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20438"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1227161.1227166"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_71"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732945"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2749456","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2749456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:39Z","timestamp":1750227399000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2749456"}},"subtitle":["A Labelling Approach"],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":36,"alternative-id":["10.1145\/2723372.2749456","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2749456","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}