The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem

This article is motivated by versions of the dynamic or “on‐line” Steiner tree problem (OST) introduced by Imase and Waxman [4]. In this problem one is given an edge‐weighted graph G and a sequence σ = (x1,…,xn) of distinct vertices of G. The requirement is to construct for each i ≤ n a tree Ti span...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Networks Jg. 45; H. 3; S. 143 - 164
Hauptverfasser:	Miller, Zevi, Pritikin, Dan, Perkel, Manley, Sudborough, I.H.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Hoboken Wiley Subscription Services, Inc., A Wiley Company 01.05.2005 John Wiley & Sons
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems dynamic greedy algorithm Exact sciences and technology on-line Steiner tree problem sequential sum problem Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Theoretical computing vertex greedy algorithm vertex greedy algorithm Spanning tree Optimal solution Greedy algorithm Connected graph on-line Steiner tree problem Steiner tree problem dynamic greedy algorithm sequential sum problem
ISSN:	0028-3045, 1097-0037
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!