國立虎尾科技大學 |

Optimal Interconnection Trees in the Plane = Theory, Algorithms and Applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Optimal Interconnection Trees in the Plane/ by Marcus Brazil, Martin Zachariasen.
其他題名:	Theory, Algorithms and Applications /
作者:	Brazil, Marcus.
其他作者:	Zachariasen, Martin.
面頁冊數:	XVII, 344 p. 150 illus., 135 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Combinatorics. -
電子資源:	https://doi.org/10.1007/978-3-319-13915-9
ISBN:	9783319139159

Optimal Interconnection Trees in the Plane = Theory, Algorithms and Applications /
Brazil, Marcus.

Optimal Interconnection Trees in the PlaneTheory, Algorithms and Applications /[electronic resource] :by Marcus Brazil, Martin Zachariasen. - 1st ed. 2015. - XVII, 344 p. 150 illus., 135 illus. in color.online resource. - Algorithms and Combinatorics,290937-5511 ;. - Algorithms and Combinatorics,29.

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.

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.

ISBN: 9783319139159

Standard No.: 10.1007/978-3-319-13915-9doiSubjects--Topical Terms:

669353
Combinatorics.

LC Class. No.: QA164-167.2

Dewey Class. No.: 511.6

Optimal Interconnection Trees in the Plane = Theory, Algorithms and Applications /
LDR:02892nam a22004095i 4500 001 960846
003 DE-He213
005 20200704001435.0
007 cr nn 008mamaa
008 201211s2015 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
035 $a 978-3-319-13915-9
050 4 $a QA164-167.2
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
072 7 $a PBV $2 thema
082 0 4 $a 511.6 $2 23
100 1 $a Brazil, Marcus. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1254953
245 1 0 $a Optimal Interconnection Trees in the Plane $h [electronic resource] : $b Theory, Algorithms and Applications / $c by Marcus Brazil, Martin Zachariasen.
250 $a 1st ed. 2015.
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 Combinatorics. $3 669353
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Geometry. $3 579899
650 0 $a Mathematical optimization. $3 527675
650 0 $a Algorithms. $3 527865
650 0 $a Applied mathematics. $3 1069907
650 0 $a Engineering mathematics. $3 562757
650 2 4 $a Discrete Mathematics in Computer Science. $3 670123
650 2 4 $a Optimization. $3 669174
650 2 4 $a Mathematical and Computational Engineering. $3 1139415
700 1 $a Zachariasen, Martin. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1254954
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783319139166
776 0 8 $i Printed edition: $z 9783319139142
776 0 8 $i Printed edition: $z 9783319354828
830 0 $a Algorithms and Combinatorics, $x 0937-5511 ; $v 29 $3 1254955
856 4 0 $u https://doi.org/10.1007/978-3-319-13915-9
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)