Steiner trees for terminals constrained to curves

We give a polynomial time algorithm for solving the Euclidean Steiner tree problem when the terminals are constrained to lie on a fixed finite set of disjoint finite-length compact simple smooth curves. The problem is known to be NP-hard in general. We also show it to be NP-hard if the terminals lie...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on discrete mathematics 1997-02, Vol.10 (1), p.1-17
Hauptverfasser:	RUBINSTEIN, J. H, THOMAS, D. A, WORMALD, N. C
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximation Combinatorics Combinatorics. Ordered structures Computer science control theory systems Exact sciences and technology Flows in networks. Combinatorial problems Graph theory Graphs Information retrieval. Graph Mathematics Operational research and scientific management Operational research. Management science Sciences and techniques of general use Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!