Check nearby libraries
Buy this book
This book is the result of 18 years of research into Steiner's problem and its relatives in theory and application. Starting with investigations of shortest networks for VLSI layout and, on the other hand, for certain facility location problems, the author has found many common properties for Steiner's problem in various spaces. The purpose of the book is to sum up and generalize many of these results for arbitrary finite-dimensional Banach spaces. It shows that we can create a homogeneous and general theory when we consider two dimensions of such spaces, and that we can find many facts which are helpful in attacking Steiner's problem in the higher-dimensional cases. The author examines the underlying mathematical properties of this network design problem and demonstrates how it can be attacked by various methods of geometry, graph theory, calculus, optimization and theoretical computer science. Audience: All mathematicians and users of applied graph theory.
Check nearby libraries
Buy this book
Previews available in: English
Showing 3 featured editions. View all 3 editions?
Edition | Availability |
---|---|
1 |
zzzz
Libraries near you:
WorldCat
|
2 |
aaaa
Libraries near you:
WorldCat
|
3 |
zzzz
Libraries near you:
WorldCat
|
Book Details
Edition Notes
Source title: Steiner Minimal Trees (Nonconvex Optimization and Its Applications (23))
Classifications
The Physical Object
ID Numbers
Community Reviews (0)
Feedback?History
- Created May 23, 2020
- 3 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
September 28, 2024 | Edited by MARC Bot | import existing book |
February 26, 2022 | Edited by ImportBot | import existing book |
May 23, 2020 | Created by ImportBot | Imported from amazon.com record |