Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Alon, N., Azar, Y.: On-line Steine trees in the euclidean plane. Discrete & Computational Geometry 10, 113–121 (1993)
2. Lecture Notes in Computer Science;R Bar-Yehuda,2012
3. Bein, W., Golin, M., Larmore, L., Zhang, Y.: The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity. ACM Transactions on Algorithms, 6(1) (2009)
4. Berman, P., Coulston, C.: On-line algorrithms for Steiner tree problems. In: STOC, pp. 344–353 (1997)
5. Charikar, M., Halperin, D., Motwani, R.: The dynamic servers problem. In: 9th Annual Symposium on Discrete Algorithms (SODA), pp. 410–419 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献