{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:12:34Z","timestamp":1742955154228,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425120"},{"type":"electronic","value":"9783540446910"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44691-5_18","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"207-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees"],"prefix":"10.1007","author":[{"given":"Guido","family":"Proietti","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0022-0000(78)90022-3","volume":"16","author":"F. Chin","year":"1978","unstructured":"F. Chin and D. Houck, Algorithms for updating minimal spanning trees, J. Comput. System Sciences, 16(3) (1978) 333\u2013344.","journal-title":"J. Comput. System Sciences"},{"issue":"6","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/0221070","volume":"21","author":"B. Dixon","year":"1992","unstructured":"B. Dixon, M. Rauch and R.E. Tarjan, Verification and sensitivityanaly sis of minimum spanning trees in linear time, SIAM J. Comput., 21(6) (1992) 1184\u20131192.","journal-title":"SIAM J. Comput."},{"issue":"3","key":"18_CR3","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. of the ACM, 34(3) (1987) 596\u2013615.","journal-title":"J. of the ACM"},{"key":"18_CR4","unstructured":"D. Frigioni, A. Marchetti-Spaccamela and U. Nanni, Fullydy namic output bounded single source shortest path problem, Proc. 7th ACM-SIAM Symposium on Discrete Algorithms (SODA\u201996), 1996, 212\u2013221."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/297096.297147","volume":"3","author":"D. Frigioni","year":"1998","unstructured":"D. Frigioni, M. Ioffreda, U. Nanni and G. Pasquale, Experimental analysis of dynamic algorithms for the single-source shortest-path problem, ACM J. of Experimental Algorithms, 3, article 5, (1998).","journal-title":"ACM J. of Experimental Algorithms"},{"key":"18_CR6","first-page":"617","volume":"7","author":"M. Gr\u00f6tschel","year":"1995","unstructured":"M. Gr\u00f6tschel, C.L. Monma and M. Stoer, Design of survivable networks, Handbooks in OR and MS, Vol. 7, Elsevier (1995) 617\u2013672.","journal-title":"Handbooks in OR and MS"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"F. Harary. Graph Theory. Addison-Wesley, Reading, MA, 1969.","DOI":"10.21236\/AD0705364"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","unstructured":"R. Hassin and A. Tamir, On the minimum diameter spanning tree problem, Inf. Proc. Letters, 53 (1995) 109\u2013111.","journal-title":"Inf. Proc. Letters"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/PL00009225","volume":"22","author":"G.F. Italiano","year":"1998","unstructured":"G.F. Italiano and R. Ramaswami, Maintaining spanning trees of small diameter, Algorithmica22(3) (1998) 275\u2013304.","journal-title":"Algorithmica"},{"key":"18_CR10","volume-title":"LEDA: a platform for combinatorial and geometric computing","author":"K. Mehlhorn","year":"1999","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: a platform for combinatorial and geometric computing. Cambridge UniversityPress, Cambridge, UK, 1999."},{"key":"18_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/3-540-68530-8_5","volume-title":"6th European Symp. on Algorithms (ESA\u201998)","author":"E. Nardelli","year":"1998","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, Finding all the best swaps of a minimum diameter spanning tree under transient edge failures, 6th European Symp. on Algorithms (ESA\u201998), Springer-Verlag, LNCS 1461, 55\u201366, 1998."},{"key":"18_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-48686-0_14","volume-title":"How to swap a failing edge of a single source shortest paths tree","author":"E. Nardelli","year":"1999","unstructured":"E. Nardelli, G. Proietti and P. Widmayer, How to swap a failing edge of a single source shortest paths tree, 5th Annual Int. Computing and Combinatorics Conf. (COCOON\u201999), Springer-Verlag, LNCS 1627, 144\u2013153, 1999."},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"G. Ramalingam and T. Reps, An incremental algorithm for a generalization of the shortest path problem, J. of Algorithms, 21 (1996) 267\u2013305.","journal-title":"J. of Algorithms"},{"issue":"2","key":"18_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R.E. Tarjan","year":"1975","unstructured":"R.E. Tarjan, Efficiencyof a good but not linear set union algorithm, J. of the ACM, 22(2) (1975) 215\u2013225.","journal-title":"J. of the ACM"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Sensitivityanaly sis of minimum spanning trees and shortest path trees, Inf. Proc. Letters, 14(1) (1982) 30\u201333.","DOI":"10.1016\/0020-0190(82)90137-5"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,29]],"date-time":"2020-04-29T13:04:46Z","timestamp":1588165486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}