A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry

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]

Abstract

Abstract is missing.