Vai al contenuto principale della pagina

Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications / / by Marcus Brazil, Martin Zachariasen



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Autore: Brazil Marcus Visualizza persona
Titolo: Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications / / by Marcus Brazil, Martin Zachariasen Visualizza cluster
Pubblicazione: Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015
Edizione: 1st ed. 2015.
Descrizione fisica: 1 online resource (XVII, 344 p. 150 illus., 135 illus. in color.)
Disciplina: 511.52
Soggetto topico: Combinatorial analysis
Computer science—Mathematics
Geometry
Mathematical optimization
Algorithms
Applied mathematics
Engineering mathematics
Combinatorics
Discrete Mathematics in Computer Science
Optimization
Mathematical and Computational Engineering
Persona (resp. second.): ZachariasenMartin
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di contenuto: 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.
Sommario/riassunto: 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.
Titolo autorizzato: Optimal Interconnection Trees in the Plane  Visualizza cluster
ISBN: 3-319-13915-0
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 9910299763503321
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Serie: Algorithms and Combinatorics, . 0937-5511 ; ; 29