Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Advances in Steiner Trees

Advances in Steiner Trees

Smith, J. M.
Rubinstein, J. Hyam
Du, Ding-Zhu

Hardcover

Series: Combinatorial Optimization, Book 6

Medical ReferenceGeneral Mathematics

ISBN10: 0792361105
ISBN13: 9780792361107
Publisher: Springer
Published: Jan 31 2000
Pages: 323
Weight: 1.44
Height: 0.81 Width: 6.14 Depth: 9.21
Language: English
The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.

Also from

Du, Ding-Zhu

View All

Also in

General Mathematics

View All