The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterogeneity of links in a data communication network. In this paper we provide a near-tight upper bound on the competitive ratio of the Online Steiner Tree problem in graphs of bounded edge asymmetry α. This problem has applications in efficient multicasting over networks with non-symmetric links. We show an improved upper bound of O(min {max {αlog k/log α, αlog k/log log k} , k1-ε}) on the competitive ratio of a simple greedy algorithm, for any request sequence of k terminals. The result almost matches the lower bound of Ω (min {max {αlog k/log α, αlog k/log log k} , k1-ε}) (where ε is an arbitrarily small constant) due to Faloutsos et al. [8] and Angelopoulos [2]. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Angelopoulos, S. (2008). A near-tight bound for the online steiner tree problem in graphs of bounded asymmetry. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5193 LNCS, pp. 76–87). Springer Verlag. https://doi.org/10.1007/978-3-540-87744-8_7
Mendeley helps you to discover research relevant for your work.