Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. Discrete and Computational Geometry 10, 113–121 (1993)
2. Angelopoulos, S.: Improved bounds for the online Steiner tree problem in graphs of bounded edge-asymmetry. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 248–257 (2007)
3. Angelopoulos, S.: A near-tight bound for the online Steiner tree problem in graphs of bounded asymmetry. In: Proceedings of the 16th Annual European Symposium on Algorithms, pp. 76–87 (2008)
4. Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. Journal of Computer and System Sciences 51(3), 341–358 (1995)
5. Berman, P., Coulston, C.: Online algorithms for Steiner tree problems. In: Proceedings of the 29th Symp. on the Theory of Computing, pp. 344–353 (1997)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献