Text

Optimal Interconnection Trees in the Plane

---

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.

---

Availability

No copy data

Detail Information

Series Title

Algorithms and Combinatorics

Call Number

-

Publisher

Cham, Switzerland : ., 2015

Collation

XVII, 344

Language

English

ISBN/ISSN

978-3-319-13914-2

Classification

NONE

Content Type

text

Media Type

computer

Carrier Type

online resource

Edition

1

Subject(s)

Algorithms
Geometry
Optimization
Discrete Mathematics
Discrete Mathematics in Computer Science

Specific Detail Info

-

Statement of Responsibility

Marcus Brazil

Other Information

Cataloger

Rani

Source

-

Validator

TAUFIK

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment