Steiner Minimal Trees

This book is the result of 18 years of research into Steiners problem and itsrelatives in theory and application. Starting with investigations of shortestnetwor... » 

This book is the result of 18 years of research into Steiners problem and itsrelatives in theory and application. Starting with investigations of shortestnetworks for VLSI layout and on the other hand for certain facility locationproblems the author has found many common properties for Steiners problem invarious spaces. The purpose of the book is to sum up and generalize many ofthese results for arbitrary finitedimensional Banach spaces. It shows that wecan create a homogeneous and general theory when we consider two dimensions ofsuch spaces and that we can find many facts which are helpful in attackingSteiners problem in the higherdimensional cases. The author examines theunderlying mathematical properties of this network design problem anddemonstrates how it can be attacked by various methods of geometry graphtheory calculus optimization and theoretical computer science. bremAudienceem All mathematicians and users of applied graph theory. «