Linear bounds for on-line Steiner problems
Information Processing Letters
Multicast tree generation in networks with asymmetric links
IEEE/ACM Transactions on Networking (TON)
On-line algorithms for Steiner tree problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
On-line generalized Steiner problem
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
A survey of combinatorial optimization problems in multicast routing
Computers and Operations Research
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online Priority Steiner Tree Problems
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the competitiveness of the online asymmetric and euclidean steiner tree problems
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
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 \left (\min \left \{ \max \left \{ \alpha \frac{\log k}{\log \alpha}, \alpha \frac{\log k}{\log \log k} \right \} ,k \right \} \right )$ on the competitive ratio of a simple greedy algorithm, for any request sequence of kterminals. The result almost matches the lower bound of $\Omega \left (\min \left \{ \max \left \{ \alpha \frac{\log k}{\log \alpha}, \alpha \frac{\log k}{\log \log k} \right \}, k^{1-\epsilon} \right \} \right )$ (where 茂戮驴is an arbitrarily small constant) due to Faloutsos et al.[8] and Angelopoulos [2].