1. Angelopoulos, S.: Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry. Technical Report CS-2006-36, David R. Cheriton School of Computer Science, University of Waterloo (2006)
2. Angelopoulos, S.: Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry. In: Bansal, N., Pruhs, K., Stein, C. (eds.) Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248–257. ACM Press, New York (2007)
3. Awerbuch, B., Azar, Y., Bartal, B.: On-line Generalized Steiner Problem. Theor. Comp. Sci. 324(2–3), 313–324 (2004)
4. Azar, Y., Alon, N.: On-line Steiner Trees in the Euclidean Plane. Discrete and Computational Geometry 10, 113–121 (1993)
5. Berman, P., Coulston, C.: Online Algorithms for Steiner Tree Problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, pp. 344–353 (1997)