Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
The Resource Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)
Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)
Resource Information
The item Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- 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
- Language
- eng
- Extent
- XVII, 344 p. 150 illus., 135 illus. in color.
- 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
- Isbn
- 9783319139159
- Label
- Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications
- Title
- Optimal Interconnection Trees in the Plane
- Title remainder
- Theory, Algorithms and Applications
- Statement of responsibility
- by Marcus Brazil, Martin Zachariasen
- Subject
-
- Computational complexity
- Geometry
- Mathematical optimization
- Algorithms
- Combinatorial analysis
- Combinatorial analysis
- Computational complexity
- Computational complexity
- Appl.Mathematics/Computational Methods of Engineering
- Mathematics
- Mathematical optimization
- Mathematical optimization
- Discrete Mathematics in Computer Science
- Geometry
- Combinatorics
- Electronic resources
- Combinatorial analysis
- Algorithms
- Engineering mathematics
- Mathematics
- Geometry
- Combinatorics
- Combinatorics
- Optimization
- Algorithms
- Engineering mathematics
- Mathematics
- Engineering mathematics
- Language
- eng
- 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
- http://library.link/vocab/creatorName
- Brazil, Marcus
- Image bit depth
- 0
- LC call number
- QA164-167.2
- Literary form
- non fiction
- http://library.link/vocab/relatedWorkOrContributorName
-
- Zachariasen, Martin
- SpringerLink
- Series statement
- Algorithms and Combinatorics,
- Series volume
- 29
- http://library.link/vocab/subjectName
-
- Mathematics
- Computational complexity
- Algorithms
- Combinatorial analysis
- Geometry
- Mathematical optimization
- Engineering mathematics
- Mathematics
- Combinatorics
- Discrete Mathematics in Computer Science
- Geometry
- Optimization
- Algorithms
- Appl.Mathematics/Computational Methods of Engineering
- Label
- Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)
- Antecedent source
- mixed
- Carrier category
- online resource
- Carrier category code
- cr
- Carrier MARC source
- rdacarrier
- Color
- not applicable
- Content category
- text
- Content type code
- txt
- Content type MARC source
- rdacontent
- 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
- Dimensions
- unknown
- Extent
- XVII, 344 p. 150 illus., 135 illus. in color.
- File format
- multiple file formats
- Form of item
- electronic
- Isbn
- 9783319139159
- Level of compression
- uncompressed
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
- c
- Other control number
- 10.1007/978-3-319-13915-9
- Other physical details
- online resource.
- Quality assurance targets
- absent
- Reformatting quality
- access
- Specific material designation
- remote
- System control number
- (DE-He213)978-3-319-13915-9
- Label
- Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)
- Antecedent source
- mixed
- Carrier category
- online resource
- Carrier category code
- cr
- Carrier MARC source
- rdacarrier
- Color
- not applicable
- Content category
- text
- Content type code
- txt
- Content type MARC source
- rdacontent
- 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
- Dimensions
- unknown
- Extent
- XVII, 344 p. 150 illus., 135 illus. in color.
- File format
- multiple file formats
- Form of item
- electronic
- Isbn
- 9783319139159
- Level of compression
- uncompressed
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
- c
- Other control number
- 10.1007/978-3-319-13915-9
- Other physical details
- online resource.
- Quality assurance targets
- absent
- Reformatting quality
- access
- Specific material designation
- remote
- System control number
- (DE-He213)978-3-319-13915-9
Subject
- Algorithms
- Algorithms
- Algorithms
- Appl.Mathematics/Computational Methods of Engineering
- Combinatorial analysis
- Combinatorial analysis
- Combinatorial analysis
- Combinatorics
- Combinatorics
- Combinatorics
- Computational complexity
- Computational complexity
- Computational complexity
- Discrete Mathematics in Computer Science
- Electronic resources
- Engineering mathematics
- Engineering mathematics
- Engineering mathematics
- Geometry
- Geometry
- Geometry
- Mathematical optimization
- Mathematical optimization
- Mathematical optimization
- Mathematics
- Mathematics
- Mathematics
- Optimization
Member of
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Optimal-Interconnection-Trees-in-the-Plane-/sVXWSJzGQ7A/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Optimal-Interconnection-Trees-in-the-Plane-/sVXWSJzGQ7A/">Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Optimal-Interconnection-Trees-in-the-Plane-/sVXWSJzGQ7A/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Optimal-Interconnection-Trees-in-the-Plane-/sVXWSJzGQ7A/">Optimal Interconnection Trees in the Plane : Theory, Algorithms and Applications, by Marcus Brazil, Martin Zachariasen, (electronic resource)</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>