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 条

[31] On Steiner trees and minimum spanning trees in hypergraphs
Polzin, T
Daneshmand, SV
OPERATIONS RESEARCH LETTERS, 2003, 31 (01) : 12 - 20
[32] Constructing minimal spanning Steiner trees with bounded path length
Pyo, I
Oh, J
Pedram, M
EUROPEAN DESIGN & TEST CONFERENCE 1996 - ED&TC 96, PROCEEDINGS, 1996, : 244 - 249
[33] Fault-Tolerant Approximate Shortest-Path Trees
Davide Bilò
Luciano Gualà
Stefano Leucci
Guido Proietti
Algorithmica, 2018, 80 : 3437 - 3460
[34] A scalable multicast routing protocol for building shortest path trees
Zhang, Baoxian
Zheng, Jun
Mouftah, Hussein T.
INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2007, 20 (08) : 993 - 1009
[35] RECOGNIZING SHORTEST-PATH TREES IN LINEAR-TIME
PENG, CH
WANG, JS
LEE, RCT
INFORMATION PROCESSING LETTERS, 1994, 52 (02) : 77 - 85
[36] Fault-Tolerant Approximate Shortest-Path Trees
Bilo, Davide
Guala, Luciano
Leucci, Stefano
Proietti, Guido
ALGORITHMS - ESA 2014, 2014, 8737 : 137 - 148
[37] A SHORTEST-PATH METRIC ON UNLABELED BINARY-TREES
BONNIN, A
PALLO, JM
PATTERN RECOGNITION LETTERS, 1992, 13 (06) : 411 - 415
[38] Tomography of scale-free networks and shortest path trees
Kalisky, Tomer
Cohen, Reuven
Mokryn, Osnat
Dolev, Danny
Shavitt, Yuval
Havlin, Shlomo
PHYSICAL REVIEW E, 2006, 74 (06):
[39] PROPERTIES OF LABELING METHODS FOR DETERMINING SHORTEST-PATH TREES
SHIER, DR
WITZGALL, C
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1981, 86 (03): : 317 - 330
[40] Embedded Backups for Link Failure Recovery in Shortest Path Trees
Qureshi, Muhammad Aasim
Hassan, Mohd Fadzil
SOFTWARE ENGINEERING AND COMPUTER SYSTEMS, PT 2, 2011, 180 : 663 - 671

← 1 2 3 4 5 →