{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:28Z","timestamp":1725543808927},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_13","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"157-170","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Rebuilding Strategy for a Decremental Tree Problem"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Thibault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Laforest","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Spaccamela, A.M., Protasi, M.: Complexity and approximation. Springer, Heidelberg (1999)"},{"key":"13_CR2","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University press, Cambridge (1998)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.: Approximation algorithms for NP-hard problems. PWS publishing company (1997)","DOI":"10.1145\/261342.571216"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"Imase, M., Waxman, B.: Dynamic steiner tree problem. SIAM J. Discr. Math.\u00a04, 369\u2013384 (1991)","journal-title":"SIAM J. Discr. Math."},{"key":"13_CR5","unstructured":"Laforest, C.: A good balance between weight and distances for multipoint trees. In: International Conference On Principles Of DIstributed Systems, pp. 195\u2013204 (2002)"},{"key":"13_CR6","volume-title":"IEEE\/ACM (SIGCOMM)","author":"S. Raghavan","year":"1999","unstructured":"Raghavan, S., Manimaran, G., Murthy, C.S.R.: A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. In: IEEE\/ACM (SIGCOMM), vol.\u00a07, ACM Press, New York (1999)"},{"key":"13_CR7","unstructured":"Thibault, N., Laforest, C.: An optimal rebuilding strategy for an incremental tree problem. Journal of interconnection networks (submitted, 2004)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B. Waxman","year":"1988","unstructured":"Waxman, B.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications\u00a06, 1617\u20131622 (1988)","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:07Z","timestamp":1619507827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11780823_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}