Complexity and Approximation of the Rectilinear Steiner Tree Problem

Complexity and Approximation of the Rectilinear Steiner Tree Problem

Show other versions (1)

Given a finite set K of terminals in the plane. A rectilinear Steiner minimum tree for K (RST) is a tree which interconnects among these terminals using only horizontal and vertical lines of shortest possible length containing Steiner point. We show the complexity of RST i.e. belongs to NP-comp...

Full description

Bibliographic Details
Main Author: Mussafi, Noor Saif Muhammad
Other Authors: TU Chemnitz, Fakultät für Mathematik
Format: Dissertation
Language:English
Published: Universitätsbibliothek Chemnitz 2009
Subjects:
Approximation Algorithm
Arora's Approximation Scheme
Graph Theory
The Steiner tree problem
The rectilinear Steiner tree problem
ddc:500
Angewandte Mathematik
Optimierungsproblem
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
http://www.qucosa.de/fileadmin/data/qucosa/documents/5843/data/mussafi
http://www.qucosa.de/fileadmin/data/qucosa/documents/5843/20090121.txt

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
http://www.qucosa.de/fileadmin/data/qucosa/documents/5843/data/mussafi
http://www.qucosa.de/fileadmin/data/qucosa/documents/5843/20090121.txt

Similar Items