Spyros Angelopoulos. A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. In Dan Halperin, Kurt Mehlhorn, editors, Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Volume 5193 of Lecture Notes in Computer Science, pages 76-87, Springer, 2008. [doi]
@inproceedings{Angelopoulos08,
title = {A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry},
author = {Spyros Angelopoulos},
year = {2008},
doi = {10.1007/978-3-540-87744-8_7},
url = {http://dx.doi.org/10.1007/978-3-540-87744-8_7},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Angelopoulos08},
cites = {0},
citedby = {0},
pages = {76-87},
booktitle = {Algorithms - ESA 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings},
editor = {Dan Halperin and Kurt Mehlhorn},
volume = {5193},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-87743-1},
}