Angelopoulos, Spyros Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Angelopoulos, S. (2010). On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. In E. Bampis, & K. Jansen (Eds.), Approximation and Online Algorithms (pp. 1-12). Berlin: Springer. doi:10.1007/978-3-642-12450-1_1.