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

]. N. Tl04a, C. Thibault, and . Laforest, Deux méthodes incrémentales pour le maintien d'un arbre de connexion, AlgoTel, pp.63-67, 2004.

N. Thibault and C. Laforest, An optimal online strategy to increment connection trees, IEEE Workshop on Adaptive Wireless Networks, 2004.

N. Thibault and C. Laforest, An Optimal Rebuilding Strategy for a Decremental Tree Problem, SIROCCO, pp.157-170, 2006.
DOI : 10.1007/11780823_13
URL : https://hal.archives-ouvertes.fr/hal-00341384

N. Thibault and C. Laforest, Minimizing the number of critical stages for the on-line steiner tree problem, In INOC, 2007.