{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:30:01Z","timestamp":1758274201956},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108761"},{"type":"electronic","value":"9783642108778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_29","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T07:11:04Z","timestamp":1259737864000},"page":"365-371","source":"Crossref","is-referenced-by-count":2,"title":["Brief Annoucement: Distributed Swap Edges Computation for Minimum Routing Cost Spanning Trees"],"prefix":"10.1007","author":[{"given":"Linda","family":"Pagli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Prencipe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1016\/j.dam.2007.07.001","volume":"156","author":"C. Liebchen","year":"2008","unstructured":"Liebchen, C., Wunsch, G.: The zoo of the tree spanner problems. Discrete Applied Mathematics\u00a0156, 569\u2013587 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"E89-D","key":"29_CR2","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1093\/ietisy\/e89-d.2.700","volume":"2","author":"P. Flocchini","year":"2006","unstructured":"Flocchini, P., Mesa Enriques, A., Pagli, L., Prencipe, G., Santoro, N.: Point-of-failure shortest-path rerouting: computing the optimal swap edges distributively. IEICE Transactions on Information and Systems\u00a02(E89-D), 700\u2013708 (2006)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.R.: The complexity of the network design problem. Networks\u00a08, 279\u2013285 (1978)","journal-title":"Networks"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s00453-002-0988-z","volume":"35","author":"E. Nardelli","year":"2003","unstructured":"Nardelli, E., Proietti, G., Widmayer, P.: Swapping a failing edge of a single source shortest-paths tree is good and fast. Algoritmica\u00a035, 56\u201374 (2003)","journal-title":"Algoritmica"},{"key":"29_CR5","volume-title":"Design and Analysis of Distributed Algorithms","author":"N. Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, Chichester (2007)"},{"issue":"3","key":"29_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-007-9080-z","volume":"50","author":"B.Y. Wu","year":"2008","unstructured":"Wu, B.Y., Hsiao, C.Y., Chao, K.M.: The swap edges of a multiple-sources routing tree. Algorithmica\u00a050(3), 299\u2013311 (2008)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:43:09Z","timestamp":1619782989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}