The Steiner problem asks for a shortest network which spans a given set of points. Minimum spanning networks have been well-studied when all connections are required to be between the given points. The novelty of the Steiner tree problem is that new auxiliary points can be introduced between the original points so that a spanning network of all the points will be shorter than otherwise possible. These new points are called Steiner points - locating them has proved problematic and research has diverged along many different avenues. This volume is devoted to the assimilation of the rich field of intriguing analyses and the consolidation of the fragments. A section has been given to each of the three major areas of interest which have emerged. The first concerns the Euclidean Steiner Problem, historically the original Steiner tree problem proposed by Jarnik and Kossler in 1934. The second deals with the Steiner Problem in Networks, which was propounded independently by Hakimi and Levin and has enjoyed the most prolific research amongst the three areas. The Rectilinear Steiner Problem, introduced by Hanan in 1965, is discussed in the third part. Additionally, a forth section has been included, with chapters discussing areas where the body of results is still emerging. The collaboration of three authors with different styles and outlooks affords individual insights within a cohesive whole.
FREE Two-Day Shipping for students on millions of items. Learn more |
| |||||||||||||||
Book Description
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
negative edge algorithm, distance network heuristic, dual ascent heuristic, isodendral regions, arc pipj, average distance heuristic, luminary algorithm, arborescence problem, given full topology, tree enumeration algorithm, length subnetworks, contraction heuristic, inner spanning tree, hexagonal tree, tree decision problem, minimum spanning tree heuristic, vertex heuristics, wiring region, ratio conjecture, rectilinear convex hull, general dynamic programming algorithm, shortest paths heuristic, rectilinear tree, artificial terminals, spanning line Key Phrases - Capitalized Phrases (CAPs): (learn more)
Technical Report, Euclidean Steiner, Computer Science, Discrete Math, Computer-Aided Design, Systematic Zoology, Discrete Comput, Acta Inf, Molecular Evolution, Design Automation Conf, Graph-Theoretic Concepts, Acta Math, Discrete Appl, The Lagrangean, Human Genetics, Lecture Notes, Purdue Univ, Circuit Theory, John Wiley, Exact Cover Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
negative edge algorithm, distance network heuristic, dual ascent heuristic, isodendral regions, arc pipj, average distance heuristic, luminary algorithm, arborescence problem, given full topology, tree enumeration algorithm, length subnetworks, contraction heuristic, inner spanning tree, hexagonal tree, tree decision problem, minimum spanning tree heuristic, vertex heuristics, wiring region, ratio conjecture, rectilinear convex hull, general dynamic programming algorithm, shortest paths heuristic, rectilinear tree, artificial terminals, spanning line Key Phrases - Capitalized Phrases (CAPs): (learn more)
Technical Report, Euclidean Steiner, Computer Science, Discrete Math, Computer-Aided Design, Systematic Zoology, Discrete Comput, Acta Inf, Molecular Evolution, Design Automation Conf, Graph-Theoretic Concepts, Acta Math, Discrete Appl, The Lagrangean, Human Genetics, Lecture Notes, Purdue Univ, Circuit Theory, John Wiley, Exact Cover Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Surprise Me!
Citations (learn more)
52
books
cite this book:
See all 52 books citing this book
- Steiner Trees in Industry (Combinatorial Optimization) by Xiuzhen Cheng on 4 pages
- Minimal NetworksThe Steiner Problem and Its Generalizations by Alexander O. Ivanov in Front Matter, and Back Matter
- Computing and Combinatorics: Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996. Proceedings (Lecture Notes in Computer Science) by Jin-Yi Cai on page 20, and page 30
- Advanced Routing of Electronic Modules (Electronic Packaging) by Michael G. Pecht on page 47, and page 133
- Algorithms and Computation: 7th International Symposium, ISAAC '96, Osaka, Japan, December 16 - 18, 1996, Proceedings (Lecture Notes in Computer Science) by Tetsuo Asano on page 74, and page 254
See all 52 books citing this book
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
