Optimal interconnection trees in the plane [electronic resource] : theory, algorithms and applications / Marcus Brazil, Martin Zachariasen.
2015
QA166.2
Linked e-resources
Linked Resource
Concurrent users
Unlimited
Authorized users
Authorized users
Document Delivery Supplied
Can lend chapters, not whole ebooks
Details
Title
Optimal interconnection trees in the plane [electronic resource] : theory, algorithms and applications / Marcus Brazil, Martin Zachariasen.
Author
ISBN
9783319139159 electronic book
3319139150 electronic book
9783319139142
3319139150 electronic book
9783319139142
Published
Cham : Springer, 2015.
Language
English
Description
1 online resource (xvii, 344 pages) : illustrations.
Item Number
10.1007/978-3-319-13915-9 doi
Call Number
QA166.2
Dewey Decimal Classification
511/.52
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.
Bibliography, etc. Note
Includes bibliographical references and index.
Access Note
Access limited to authorized users.
Source of Description
Online resource; title from PDF title page (SpringerLink, viewed April 28, 2015).
Added Author
Series
Algorithms and combinatorics ; volume 29.
Available in Other Form
Print version: 9783319139142
Linked Resources
Record Appears in
Table of 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.
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.