Balancing Steiner trees and shortest path trees online

被引：0
|
作者：
Goel, A [1 ]
Munagala, K [1 ]
机构：
[1] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
来源：
PROCEEDINGS OF THE ELEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2000年
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a weighted undirected graph G(V, E) and a subset R of V, we present an online algorithm for finding a Steiner tree on R that simultaneously approximates the shortest path tree and the minimum weight Steiner tree. The cost of the tree we construct is within an O(log \R\) factor of the optimal cost, and the path length from the root to any terminal is at most O(1) times the shortest path length. The algorithm needs to perform at most one reroute for each node in the tree.
引用
收藏
页码：562 / 563
页数：2
相关论文
共 50 条
12345