Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry

Spyros Angelopoulos. Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. In Nikhil Bansal, Kirk Pruhs, Clifford Stein, editors, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007. pages 248-257, SIAM, 2007. [doi]

Abstract

Abstract is missing.