{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:06Z","timestamp":1759637946005,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642051173"},{"type":"electronic","value":"9783642051180"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05118-0_10","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T07:32:03Z","timestamp":1257319923000},"page":"133-148","source":"Crossref","is-referenced-by-count":5,"title":["A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees"],"prefix":"10.1007","author":[{"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Gradinariu","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephane","family":"Rovedakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Hu, Y., Rowstron, A.: Topology-aware routing in structured peer-to-peer overlay networks. In: Future Directions in Distributed Computing, pp. 103\u2013107 (2003)","DOI":"10.1007\/3-540-37795-6_19"},{"issue":"5","key":"10_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1317379.1317381","volume":"41","author":"A.M. Kermarrec","year":"2007","unstructured":"Kermarrec, A.M., van Steen, M.: Gossiping in distributed systems. Operating Systems Review\u00a041(5), 2\u20137 (2007)","journal-title":"Operating Systems Review"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/net.3230170203","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in networks: a survey. Networks\u00a017(2), 129\u2013167 (1987)","journal-title":"Networks"},{"issue":"3","key":"10_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. Discrete Math.\u00a04(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/11549468_67","volume-title":"Euro-Par 2005 Parallel Processing","author":"L. Gatani","year":"2005","unstructured":"Gatani, L., Re, G.L., Gaglio, S.: A dynamic distributed algorithm for multicast path setup. In: Cunha, J.C., Medeiros, P.D. (eds.) Euro-Par 2005. LNCS, vol.\u00a03648, pp. 595\u2013605. Springer, Heidelberg (2005)"},{"issue":"11","key":"10_CR6","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. Dijkstra","year":"1974","unstructured":"Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Commun. ACM\u00a017(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"key":"10_CR7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"10_CR8","unstructured":"Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. 1997 (1997)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing algorithm for the steiner tree problem. In: SRDS, p. 396 (2002)","DOI":"10.1109\/RELDIS.2002.1180217"},{"issue":"2","key":"10_CR10","first-page":"299","volume":"E87-D","author":"S. Kamei","year":"2002","unstructured":"Kamei, S., Kakugawa, H.: A self-stabilizing algorithm for the steiner tree problem. IEICE Transactions on Information and System\u00a0E87-D(2), 299\u2013307 (2002)","journal-title":"IEICE Transactions on Information and System"},{"issue":"2","key":"10_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF00289500","volume":"23","author":"Y.F. Wu","year":"1986","unstructured":"Wu, Y.F., Widmayer, P., Wong, C.: A faster approximation algorithm for the steiner problem in graphs. Acta Inf.\u00a023(2), 223\u2013229 (1986)","journal-title":"Acta Inf."},{"issue":"1-2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0020-0255(93)90128-9","volume":"74","author":"G.H. Chen","year":"1993","unstructured":"Chen, G.H., Houle, M., Kuo, M.T.: The steiner problem in distributed computing systems. Informtion Sciences\u00a074(1-2), 73\u201396 (1993)","journal-title":"Informtion Sciences"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-75142-7_10","volume-title":"Distributed Computing","author":"J. Burman","year":"2007","unstructured":"Burman, J., Kutten, S.: Time optimal asynchronous self-stabilizing spanning tree. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 92\u2013107. Springer, Heidelberg (2007)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-76627-8_18","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C. Delporte-Gallet","year":"2007","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Robust stabilizing leader election. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol.\u00a04838, pp. 219\u2013233. Springer, Heidelberg (2007)"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-540-87779-0_44","volume-title":"Distributed Computing","author":"S. Piergiovanni","year":"2008","unstructured":"Piergiovanni, S., Baldoni, R.: Brief announcement: Eventual leader election in the infinite arrival message-passing system model. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 518\u2013519. Springer, Heidelberg (2008)"},{"key":"10_CR16","unstructured":"Welch, J., Walter, J.: An asynchronous leader election algorithm for dynamic networks. In: Proc. of Inter. Par. and Distrib. Proc. Symp., IPDPS (2009)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Blin, L., Potop-Butucaru, M., Rovedakis, S.: A superstabilizing log(n)-approximation algorithm for dynamic steiner trees. Technical Report hal-00363003, HAL (2009)","DOI":"10.1007\/978-3-642-05118-0_10"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05118-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T02:00:25Z","timestamp":1739412025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05118-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642051173","9783642051180"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05118-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}