|
|
|
|
| LEADER |
03513nmm a2200469 u 4500 |
| 001 |
EB002120126 |
| 003 |
EBX01000000000000001258183 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
221028 ||| eng |
| 020 |
|
|
|a 0080867936
|
| 020 |
|
|
|a 9786611789688
|
| 020 |
|
|
|a 1281789682
|
| 020 |
|
|
|a 9780080867939
|
| 020 |
|
|
|a 9781281789686
|
| 020 |
|
|
|a 044489098X
|
| 020 |
|
|
|a 9780444890986
|
| 050 |
|
4 |
|a QA166.3
|
| 100 |
1 |
|
|a Hwang, Frank
|
| 245 |
0 |
0 |
|a The Steiner tree problem
|c Frank K. Hwang, Dana S. Richards, Pawel Winter
|
| 260 |
|
|
|a Amsterdam
|b North-Holland
|c 1992, 1992
|
| 300 |
|
|
|a xi, 339 pages
|b illustrations
|
| 505 |
0 |
|
|a Front Cover; The Steiner Tree Problem; Copyright Page; Foreword; Contents; Part I: Euclidean Steiner Problem; Chapter 1. Introduction; Chapter 2. Exact Algorithms; Chapter 3. The Steiner Ratio; Chapter 4. Heuristics; Chapter 5. Special Terminal-Sets; Chapter 6. Generalizations; Part II: Steiner Problem in Networks; Chapter 1. Introduction; Chapter 2. Reductions; Chapter 3. Exact Algorithms; Chapter 4. Heuristics; Chapter 5. Polynomially Solvable Cases; Chapter 6. Generalizations; Part III: Rectilinear Steiner Problem; Chapter 1. Introduction; Chapter 2. Heuristic Algoritlinis
|
| 505 |
0 |
|
|a Includes bibliographical references and indexes
|
| 653 |
|
|
|a Steiner systems / fast / (OCoLC)fst01132934
|
| 653 |
|
|
|a Netwerkanalyse / gtt
|
| 653 |
|
|
|a MATHEMATICS / Graphic Methods / bisacsh
|
| 653 |
|
|
|a Handelsreizigersprobleem / gtt
|
| 653 |
|
|
|a Systèmes de Steiner
|
| 653 |
|
|
|a Steiner systems / http://id.loc.gov/authorities/subjects/sh85127898
|
| 653 |
|
|
|a Steiner, systèmes de / ram
|
| 653 |
|
|
|a Graph theory
|
| 700 |
1 |
|
|a Richards, Dana
|
| 700 |
1 |
|
|a Winter, Pawel
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Annals of discrete mathematics
|
| 776 |
|
|
|z 0080867936
|
| 776 |
|
|
|z 9780080867939
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/01675060/53
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511/.5
|
| 520 |
|
|
|a 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 Jarník and Kössler 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
|