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: Technische Universität Chemnitz
Format: Dissertation
Language:English
Published: 2009
Subjects:
info:eu-repo/classification/ddc/500
ddc:500
Angewandte Mathematik
Optimierungsproblem
Approximation Algorithm
Arora's Approximation Scheme
Graph Theory
The Steiner tree problem
The rectilinear Steiner tree problem
Online Access:http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
https://monarch.qucosa.de/id/qucosa%3A19169
https://monarch.qucosa.de/api/qucosa%3A19169/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A19169/attachment/ATT-1/

Internet

http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200901213
https://monarch.qucosa.de/id/qucosa%3A19169
https://monarch.qucosa.de/api/qucosa%3A19169/attachment/ATT-0/
https://monarch.qucosa.de/api/qucosa%3A19169/attachment/ATT-1/

Similar Items