1 option
Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications / by Marcus Brazil, Martin Zachariasen.
Springer Nature - Springer Mathematics and Statistics eBooks 2015 English International Available online
View online- Format:
- Book
- Author/Creator:
- Brazil, Marcus, Author.
- Zachariasen, Martin, Author.
- Series:
- Algorithms and Combinatorics, 0937-5511 ; 29
- Language:
- English
- Subjects (All):
- Combinatorial analysis.
- Computer science—Mathematics.
- Geometry.
- Mathematical optimization.
- Algorithms.
- Applied mathematics.
- Engineering mathematics.
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Optimization.
- Mathematical and Computational Engineering.
- Local Subjects:
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Geometry.
- Optimization.
- Algorithms.
- Mathematical and Computational Engineering.
- Physical Description:
- 1 online resource (XVII, 344 p. 150 illus., 135 illus. in color.)
- Edition:
- 1st ed. 2015.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2015.
- Language Note:
- English
- Summary:
- 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.
- Contents:
- 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.
- Notes:
- Bibliographic Level Mode of Issuance: Monograph
- Description based on publisher supplied metadata and other sources.
- ISBN:
- 3-319-13915-0
- OCLC:
- 908105002
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.