{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:40:37Z","timestamp":1742967637463,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_8","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"88-99","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic Arc-Flags in Road Networks"],"prefix":"10.1007","author":[{"given":"Gianlorenzo","family":"D\u2019Angelo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camillo","family":"Vitale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Berrettini, E., D\u2019Angelo, G., Delling, D.: Arc-flags in dynamic graphs. In: 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS 2009). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, Germany (2009)"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11786-007-0023-5","volume":"1","author":"F. Bruera","year":"2008","unstructured":"Bruera, F., Cicerone, S., D\u2019Angelo, G., Stefano, G.D., Frigioni, D.: Dynamic multi-level overlay graphs for shortest paths. Mathematics in Computer Science\u00a01(4), 709\u2013736 (2008)","journal-title":"Mathematics in Computer Science"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-14866-8_9","volume-title":"Algorithm Engineering","author":"D. Delling","year":"2010","unstructured":"Delling, D., Hoffmann, R., Kandyba, M., Schulze, A.: Chapter 9. Case Studies. In: M\u00fcller-Hannemann, M., Schirra, S. (eds.) Algorithm Engineering. LNCS, vol.\u00a05971, pp. 389\u2013445. Springer, Heidelberg (2010)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-02094-0_7","volume-title":"Algorithmics of Large and Complex Networks","author":"D. Delling","year":"2009","unstructured":"Delling, D., Sanders, P., Schultes, D., Wagner, D.: Engineering Route Planning Algorithms. In: Lerner, J., Wagner, D., Zweig, K.A. (eds.) Algorithmics of Large and Complex Networks. LNCS, vol.\u00a05515, pp. 117\u2013139. Springer, Heidelberg (2009)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1999.1048","volume":"34","author":"D. Frigioni","year":"2000","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic algorithms for maintaining shortest paths trees. Journal of Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"Journal of Algorithms"},{"key":"8_CR8","unstructured":"Goldberg, A.V., Harrelson, C.: Computing the Shortest Path: A* Search Meets Graph Theory. In: 16th Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 156\u2013165 (2005)"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Hilger, M., K\u00f6hler, E., M\u00f6hring, R.H., Schilling, H.: Fast Point-to-Point Shortest Path Computations with Arc-Flags. In: Shortest Path Computations: Ninth DIMACS Challenge. DIMACS Book, vol.\u00a024 (2009)","DOI":"10.1090\/dimacs\/074\/03"},{"key":"8_CR10","unstructured":"Karypis, G.: METIS - A Family of Multilevel Partitioning Algorithms (2007)"},{"key":"8_CR11","first-page":"219","volume":"22","author":"U. Lauther","year":"2004","unstructured":"Lauther, U.: An extremely fast, exact algorithm for finding shortest paths. Static Networks with Geographical Background\u00a022, 219\u2013230 (2004)","journal-title":"Static Networks with Geographical Background"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H., Schilling, H., Sch\u00fctz, B., Wagner, D., Willhalm, T.: Partitioning Graphs to Speedup Dijkstra\u2019s Algorithm. ACM J. Exp. Algorithmics\u00a011, 2.8 (2006)","DOI":"10.1145\/1187436.1216585"},{"key":"8_CR13","unstructured":"PTV AG - Planung Transport Verkehr (2008), \n                      \n                        http:\/\/www.ptv.de"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering Highway Hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_2","volume-title":"Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Dynamic Highway-Node Routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F. Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.: Using Multi-Level Graphs for Timetable Information in Railway Systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/978-3-540-39658-1_69","volume-title":"Algorithms - ESA 2003","author":"D. Wagner","year":"2003","unstructured":"Wagner, D., Willhalm, T.: Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 776\u2013787. Springer, Heidelberg (2003)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric Containers for Efficient Shortest-Path Computation. ACM J. Exp. Algorithmics\u00a010, 1.3 (2005)","DOI":"10.1145\/1064546.1103378"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:09:37Z","timestamp":1558570177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}