Faster algorithm for optimum Steiner trees

Faster algorithm for optimum Steiner trees

► New exact algorithm for the Steiner tree problem in weighted graphs. ► Faster than previous algorithms for moderate number of terminals. ► Based on dynamic programming and a new tree composition theorem. We present a new deterministic algorithm for the Steiner tree problem in weighted graphs. Its...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information processing letters 2011-11, Vol.111 (21), p.1075-1079
1. Verfasser: Vygen, Jens
Format: Artikel
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Calculus of variations and optimal control
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Design of algorithms
Dynamic programming
Exact sciences and technology
Graph algorithms
Graph theory
Mathematical analysis
Mathematics
Miscellaneous
Optimization algorithms
Sciences and techniques of general use
Steiner tree problem
Studies
Theoretical computing
Tree composition
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:► New exact algorithm for the Steiner tree problem in weighted graphs. ► Faster than previous algorithms for moderate number of terminals. ► Based on dynamic programming and a new tree composition theorem. We present a new deterministic algorithm for the Steiner tree problem in weighted graphs. Its running time is O ( n k 2 k + ( log 2 k ) ( log 2 n ) ) , where n is the number of vertices and k is the number of terminals. This is faster than all previously known algorithms if log n ( log log n ) 3 < k < ( n − log 2 n ) / 2 . Our algorithm is based on a new tree composition theorem.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2011.08.005