Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference40 articles.
1. Agrawal, A., Klein, P.N., Ravi, R.: When trees collide: an approximation algorithm for the generalized steiner tree problem on networks. SIAM J. Comput. 24, 440–456 (1995)
2. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. Trans. Algorithm. 2(4), 640–660 (2006)
3. Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. Discret. Comput. Geom. 10, 113–121 (1993)
4. 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 (SODA), pp. 248–257 (2007)
5. 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 (ESA), pp. 76–87 (2008)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Online Algorithms for Prize-Collecting Optimization Problems;Enterprise Information Systems;2022
2. Algorithmic View of Online Prize-collecting Optimization Problems;Proceedings of the 23rd International Conference on Enterprise Information Systems;2021