{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:26:17Z","timestamp":1742952377543,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035772"},{"type":"electronic","value":"9783319035789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-03578-9_24","type":"book-chapter","created":{"date-parts":[[2013,11,8]],"date-time":"2013-11-08T08:52:11Z","timestamp":1383900731000},"page":"286-297","source":"Crossref","is-referenced-by-count":7,"title":["Dynamically Maintaining Shortest Path Trees under Batches of Updates"],"prefix":"10.1007","author":[{"given":"Annalisa","family":"D\u2019Andrea","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mattia","family":"D\u2019Emidio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Frigioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Leucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-33090-2_4","volume-title":"Algorithms \u2013 ESA 2012","author":"I. Abraham","year":"2012","unstructured":"Abraham, I., Delling, D., Goldberg, A.V., Werneck, R.F.: Hierarchical hub labelings for shortest paths. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 24\u201335. Springer, Heidelberg (2012)"},{"key":"24_CR2","doi-asserted-by":"crossref","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. ACM Journal on Experimental Algorithms\u00a015, Article 2.3 (2010)","DOI":"10.1145\/1671970.1671976"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-02011-7_7","volume-title":"Experimental Algorithms","author":"R. Bauer","year":"2009","unstructured":"Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 51\u201362. Springer, Heidelberg (2009)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bernstein, A.: Maintaining shortest paths under deletions in weighted directed graphs. In: Proceedings of 45th ACM STOC, pp. 725\u2013734. ACM (2013)","DOI":"10.1145\/2488608.2488701"},{"key":"24_CR5","unstructured":"Brodal, G.S.: Worst-case efficient priority queues. In: Proceedings seventh ACM-SIAM Symposium on Discrete algorithms, pp. 52\u201358. SIAM (1996)"},{"issue":"4","key":"24_CR6","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., Di Stefano, G., 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"},{"issue":"2","key":"24_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1287\/ijoc.1070.0231","volume":"20","author":"L.S. Buriol","year":"2008","unstructured":"Buriol, L.S., Resende, M.G.C., Thorup, M.: Speeding up dynamic shortest-path algorithms. INFORMS Journal on Computing\u00a020(2), 191\u2013204 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"58","key":"24_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TC.2008.198","volume":"4","author":"E.P.F. Chan","year":"2009","unstructured":"Chan, E.P.F., Yang, Y.: Shortest path tree computation in dynamic graphs. IEEE Transactions on Computers\u00a04(58), 541\u2013557 (2009)","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20662-7_32","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2011","unstructured":"Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Customizable route planning. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol.\u00a06630, pp. 376\u2013387. Springer, Heidelberg (2011)"},{"key":"24_CR10","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":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/PL00009224","volume":"22","author":"D. Frigioni","year":"1998","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Semidynamic algorithms for maintaining single source shortest paths trees. Algorithmica\u00a022(3), 250\u2013274 (1998)","journal-title":"Algorithmica"},{"issue":"2","key":"24_CR12","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. J. of Algorithms\u00a034(2), 251\u2013281 (2000)","journal-title":"J. of Algorithms"},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0196-6774(03)00082-8","volume":"49","author":"D. Frigioni","year":"2003","unstructured":"Frigioni, D., Marchetti-Spaccamela, A., Nanni, U.: Fully dynamic shortest paths in digraphs with arbitrary arc weights. J. of Algorithms\u00a049(1), 86\u2013113 (2003)","journal-title":"J. of Algorithms"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1287\/trsc.1110.0401","volume":"46","author":"R. Geisberger","year":"2012","unstructured":"Geisberger, R., Sanders, P., Schultes, D., Vetter, C.: Exact routing in large road networks using contraction hierarchies. Transportation Sc.\u00a046(3), 388\u2013404 (2012)","journal-title":"Transportation Sc."},{"issue":"6","key":"24_CR15","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1109\/90.893870","volume":"8","author":"P. Narv\u00e1ez","year":"2000","unstructured":"Narv\u00e1ez, P., Siu, K.Y., Tzeng, H.Y.: New dynamic algorithms for shortest path tree computation. IEEE\/ACM Transactions on Networking\u00a08(6), 734\u2013746 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest paths problem. Journal of Algorithms\u00a021, 267\u2013305 (1996)","journal-title":"Journal of Algorithms"},{"issue":"1&2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: On the computational complexity of dynamic graph problems. Theor. Comput. Sci.\u00a0158(1&2), 233\u2013277 (1996)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"24_CR18","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1137\/090776573","volume":"41","author":"L. Roditty","year":"2012","unstructured":"Roditty, L., Zwick, U.: Dynamic approximate all-pairs shortest paths in undirected graphs. SIAM J. on Computing\u00a041(3), 670\u2013683 (2012)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03578-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T23:45:05Z","timestamp":1558655105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03578-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035772","9783319035789"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03578-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}