{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:49:34Z","timestamp":1768902574693,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319937120","type":"print"},{"value":"9783319937137","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93713-7_7","type":"book-chapter","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:19:02Z","timestamp":1528762742000},"page":"89-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Preprocessing Parallelization for the ALT-Algorithm"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"Genaro","family":"Peque","sequence":"first","affiliation":[]},{"given":"Junji","family":"Urata","sequence":"additional","affiliation":[]},{"given":"Takamasa","family":"Iryo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E Dijkstra","year":"1959","unstructured":"Dijkstra, E.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959)","journal-title":"Numer. Math."},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-70918-3_3","volume-title":"STACS 2007","author":"D Wagner","year":"2007","unstructured":"Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 23\u201336. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70918-3_3"},{"key":"7_CR3","unstructured":"Goldberg, A., Harrelson, C.: Computing the shortest path: A* search meets graph theory. Technical report (2004)"},{"key":"7_CR4","unstructured":"Gutman, R.: Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In: Proceedings 6th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 100\u2013111. SIAM (2004)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Delling, D.: Contraction hierarchies: Faster and simpler hierarchical routing in road networks. In: WEA, pp. 319\u2013333 (2008)","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 568\u2013579. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_51"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"2.4","DOI":"10.1145\/1498698.1537599","volume":"14","author":"Reinhard Bauer","year":"2009","unstructured":"Bauer, R., Delling, D.: SHARC: fast and robust unidirectional routing. ACM J. Exp. Algorithmics 14 (2009)","journal-title":"Journal of Experimental Algorithmics"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-02011-7_13","volume-title":"Experimental Algorithms","author":"D Delling","year":"2009","unstructured":"Delling, D., Wagner, D.: Pareto paths with SHARC. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol. 5526, pp. 125\u2013136. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02011-7_13"},{"key":"7_CR9","unstructured":"Goldberg, A., Werneck, R.: Computing point-to-point shortest paths from external memory. In: Proceedings Workshop on Algorithm Engineering and Experiments (ALENEX 2005). SIAM (2005)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/11427186_13","volume-title":"Experimental and Efficient Algorithms","author":"E K\u00f6hler","year":"2005","unstructured":"K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Acceleration of shortest path and constrained shortest path computation. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol. 3503, pp. 126\u2013138. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11427186_13"},{"key":"7_CR11","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths in static networks with geographical background. In: Geoinformation und Mobilitat - von der Forschung zur praktischen Anwendung, vol. 22, pp. 219\u2013230. IfGI prints (2004)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68552-4_23","volume-title":"Experimental Algorithms","author":"R Bauer","year":"2008","unstructured":"Bauer, R., Delling, D., Sanders, P., Schieferdecker, D., Schultes, D., Wagner, D.: Combining hierarchical and goal-directed speed-up techniques for Dijkstra\u2019s algorithm. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 303\u2013318. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68552-4_23"},{"key":"7_CR13","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Highway hierarchies star. In: 9th DIMACS Implementation Challenge (2006)"},{"key":"7_CR14","unstructured":"Peque Jr., G., Urata, J., Iryo, T.: Implementing an ALT algorithm for large-scale time-dependent networks. In: Proceedings of the 22nd International Conference of Hong Kong Society for Transport Studies, 9\u201311 December 2017"},{"key":"7_CR15","unstructured":"Fuchs, F.: On Preprocessing the ALT Algorithm. Master\u2019s thesis, University of the State of Baden-Wuerttemberg and National Laboratory of the Helmholtz Association, Institute for Theoretical Informatics (2010)"},{"key":"7_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77978-0","volume-title":"Algorithms and Data Structures: The Basic Toolbox","author":"K Mehlhorn","year":"2008","unstructured":"Mehlhorn, K., Sanders, P.: Algorithms and Data Structures: The Basic Toolbox. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77978-0"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Tretyakov, K., Armas-Cervantes, A., Garc\u00eda-Ba\u00f1uelos, L., Vilo, J., Dumas, M.: Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs. In: Proceedings 20th CIKM Conference, pp. 1785\u20131794 (2011)","DOI":"10.1145\/2063576.2063834"},{"key":"7_CR18","unstructured":"Campbell Jr., N.: Computing shortest paths using A*, landmarks, and polygon inequalities. arXiv:1603.01607 [cs.DS] (2016)"},{"key":"7_CR19","unstructured":"Campbell Jr., N.: Using quadrilaterals to compute the shortest path. arXiv:1603.00963 [cs.DS] (2016)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D.: Optimizing landmark-based routing and preprocessing. In: Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science (IWCTS 2013), New York, pp. 25\u201330, November 2013","DOI":"10.1145\/2533828.2533838"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Efentakis, A., Pfoser, D., Vassiliou, Y.: SALT. A unified framework for all shortest-path query variants on road networks. arXiv:1411.0257 [cs.DS] (2014)","DOI":"10.1007\/978-3-319-20086-6_23"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93713-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:03:32Z","timestamp":1654992212000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93713-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319937120","9783319937137"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93713-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"406","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":"148","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":"60","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":"36% - 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":"3","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}