|
Books > Computing & IT > General theory of computing
|
Buy Now
Advances in Steiner Trees (Paperback, Softcover reprint of hardcover 1st ed. 2000)
Loot Price: R2,970
Discovery Miles 29 700
|
|
|
Advances in Steiner Trees (Paperback, Softcover reprint of hardcover 1st ed. 2000)
Series: Combinatorial Optimization, 6
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
(1)
(3)
