|
|
|
|
| LEADER |
03426nam a22005775i 4500 |
| 001 |
978-3-319-13915-9 |
| 003 |
DE-He213 |
| 005 |
20151103131504.0 |
| 007 |
cr nn 008mamaa |
| 008 |
150413s2015 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783319139159
|9 978-3-319-13915-9
|
| 024 |
7 |
|
|a 10.1007/978-3-319-13915-9
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA164-167.2
|
| 072 |
|
7 |
|a PBV
|2 bicssc
|
| 072 |
|
7 |
|a MAT036000
|2 bisacsh
|
| 082 |
0 |
4 |
|a 511.6
|2 23
|
| 100 |
1 |
|
|a Brazil, Marcus.
|e author.
|
| 245 |
1 |
0 |
|a Optimal Interconnection Trees in the Plane
|h [electronic resource] :
|b Theory, Algorithms and Applications /
|c by Marcus Brazil, Martin Zachariasen.
|
| 264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2015.
|
| 300 |
|
|
|a XVII, 344 p. 150 illus., 135 illus. in color.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Algorithms and Combinatorics,
|x 0937-5511 ;
|v 29
|
| 505 |
0 |
|
|a Preface:- 1 Euclidean and Minkowski Steiner Trees -- 2 Fixed Orientation Steiner Trees -- 3 Rectilinear Steiner Trees -- 4 Steiner Trees with Other Costs and Constraints -- 5 Steiner Trees in Graphs and Hypergraphs -- A Appendix.
|
| 520 |
|
|
|a This book explores fundamental aspects of geometric network optimisation with applications to a variety of real world problems. It presents, for the first time in the literature, a cohesive mathematical framework within which the properties of such optimal interconnection networks can be understood across a wide range of metrics and cost functions. The book makes use of this mathematical theory to develop efficient algorithms for constructing such networks, with an emphasis on exact solutions. Marcus Brazil and Martin Zachariasen focus principally on the geometric structure of optimal interconnection networks, also known as Steiner trees, in the plane. They show readers how an understanding of this structure can lead to practical exact algorithms for constructing such trees. The book also details numerous breakthroughs in this area over the past 20 years, features clearly written proofs, and is supported by 135 colour and 15 black and white figures. It will help graduate students, working mathematicians, engineers and computer scientists to understand the principles required for designing interconnection networks in the plane that are as cost efficient as possible.
|
| 650 |
|
0 |
|a Mathematics.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Geometry.
|
| 650 |
|
0 |
|a Mathematical optimization.
|
| 650 |
|
0 |
|a Combinatorics.
|
| 650 |
|
0 |
|a Applied mathematics.
|
| 650 |
|
0 |
|a Engineering mathematics.
|
| 650 |
1 |
4 |
|a Mathematics.
|
| 650 |
2 |
4 |
|a Combinatorics.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Geometry.
|
| 650 |
2 |
4 |
|a Optimization.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Appl.Mathematics/Computational Methods of Engineering.
|
| 700 |
1 |
|
|a Zachariasen, Martin.
|e author.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783319139142
|
| 830 |
|
0 |
|a Algorithms and Combinatorics,
|x 0937-5511 ;
|v 29
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-13915-9
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SMA
|
| 950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|
