Abstract
This paper addresses the competitiveness of online algorithms for two Steiner Tree problems. In the first problem, the underlying graph is directed and has bounded asymmetry, namely the maximum weight of antiparallel links in the graph does not exceed a parameter α. Previous work on this problem has left a gap on the competitive ratio which is as large as logarithmic in k. We present a refined analysis, both in terms of the upper and the lower bounds, that closes the gap and shows that a greedy algorithm is optimal for all values of the parameter α.
The second part of the paper addresses the Euclidean Steiner tree problem on the plane. Alon and Azar [SoCG 1992, Disc. Comp. Geom. 1993] gave an elegant lower bound on the competitive ratio of any deterministic algorithm equal to Ω(logk/ loglogk); however, the best known upper bound is the trivial bound O(logk). We give the first analysis that makes progress towards closing this long-standing gap. In particular, we present an online algorithm with competitive ratio O(logk/ loglogk), provided that the optimal offline Steiner tree belongs in a class of trees with relatively simple structure. This class comprises not only the adversarial instances of Alon and Azar, but also all rectilinear Steiner trees which can be decomposed in a polylogarithmic number of rectilinear full Steiner trees.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N., Azar, Y.: On-line Steiner trees in the Euclidean plane. Discrete and Computational Geometry 10, 113–121 (1993)
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)
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)
Bartal, Y., Fiat, A., Rabani, Y.: Competitive algorithms for distributed data management. Journal of Computer and System Sciences 51(3), 341–358 (1995)
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)
Bern, M., Eppstein, D.: Approximation Algorithms for NP-hard problems. In: Hochbaum, D.S. (ed.) Approximation Algorithms for Geometric Problems, ch. 8. PWS Publishing Company (1997)
Faloutsos, M., Pankaj, R., Sevcik, K.C.: The effect of asymmetry on the on-line multicast routing problem. Int. J. Found. Comput. Sci. 13(6), 889–910 (2002)
Imase, M., Waxman, B.: The dynamic Steiner tree problem. SIAM Journal on Discrte Mathematics 4(3), 369–384 (1991)
Ramanathan, S.: Multicast tree generation in networks with asymmetric links. IEEE/ACM Transactions on Networking 4(4), 558–568 (1996)
Westbrook, J., Yan, D.C.K.: Linear bounds for online Steiner problems. Information Processing Letters 55(2), 59–63 (1995)
Winter, P., Zachariasen, M.: Euclidean Steiner minimum trees: An improved exact algorithm. Networks 30(3), 149–166 (1997)
Zachariasen, M.: Rectilinear full Steiner tree generation. Networks 2(33) (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelopoulos, S. (2010). On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-12450-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12449-5
Online ISBN: 978-3-642-12450-1
eBook Packages: Computer ScienceComputer Science (R0)