Advances in Steiner Trees (Combinatorial Optimization, 6)
ISBN-13:
9780792361107
ISBN-10:
0792361105
Edition:
2000
Author:
Ding-Zhu Du
Publication date:
2000
Publisher:
Springer
Format:
Hardcover
335 pages
Category:
Computer Science
,
Graphics & Design
,
Algorithms
,
Programming
,
Schools & Teaching
FREE US shipping
Book details
ISBN-13:
9780792361107
ISBN-10:
0792361105
Edition:
2000
Author:
Ding-Zhu Du
Publication date:
2000
Publisher:
Springer
Format:
Hardcover
335 pages
Category:
Computer Science
,
Graphics & Design
,
Algorithms
,
Programming
,
Schools & Teaching
Summary
Advances in Steiner Trees (Combinatorial Optimization, 6) (ISBN-13: 9780792361107 and ISBN-10: 0792361105), written by authors
Ding-Zhu Du, was published by Springer in 2000.
With an overall rating of 4.2 stars, it's a notable title among other
Computer Science
(Graphics & Design, Algorithms, Programming, Schools & Teaching) books. You can easily purchase or rent Advances in Steiner Trees (Combinatorial Optimization, 6) (Hardcover) from BooksRun,
along with many other new and used
Computer Science
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
Description
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.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}