J. Burman and S. Kutten, Time Optimal Asynchronous Self-stabilizing Spanning Tree, DISC, pp.92-107, 2007.
DOI : 10.1007/978-3-540-75142-7_10

L. Blin, M. Gradinariu-potop-butucaru, and S. Rovedakis, A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees, 2009.
DOI : 10.1007/978-3-642-05118-0_10
URL : https://hal.archives-ouvertes.fr/hal-00363003

C. Delporte-gallet, S. Devismes, and H. Fauconnier, Robust Stabilizing Leader Election, SSS, pp.219-233, 2007.
DOI : 10.1007/978-3-540-76627-8_18
URL : https://hal.archives-ouvertes.fr/hal-00167935

L. Gatani, G. Lo-re, and S. Gaglio, A Dynamic Distributed Algorithm for Multicast Path Setup, Euro-Par, pp.595-605, 2005.
DOI : 10.1007/11549468_67

M. Imase and B. M. Waxman, Dynamic Steiner Tree Problem, SIAM Journal on Discrete Mathematics, vol.4, issue.3, pp.369-384, 1991.
DOI : 10.1137/0404033

S. Kamei and H. Kakugawa, A self-stabilizing algorithm for the Steiner tree problem, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., p.396, 2002.
DOI : 10.1109/RELDIS.2002.1180217

S. Kamei and H. Kakugawa, A self-stabilizing algorithm for the Steiner tree problem, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings., pp.87-299, 2002.
DOI : 10.1109/RELDIS.2002.1180217

S. Tucci, P. , and R. Baldoni, Brief announcement : Eventual leader election in the infinite arrival message-passing system model, DISCWin87] Pawel Winter. Steiner problem in networks : a survey. Networks, pp.518-519129, 1987.

Y. Wu, P. Widmayer, and C. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica, vol.24, issue.2, pp.223-229, 1986.
DOI : 10.1007/BF00289500