Overview

This book is the result of many 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. The work should be of interest to all mathematicians and users of applied graph theory.

Full Product Details

9780792349839

Table of Contents

Reviews

In summary, this is a well written book on an interesting and challenging range of problems but from a mathematician's viewpoint. As such it can be strongly recommended.' Journal of the Operational Research Society, 49: 12 (1998) The book has an encyclopedic character, contains lots of information and seems a must for those interested in the subject.' Nieuw Archief voor Wiskunde, 5/1: 1 (2000)

Author Information

Tab Content 6

Customer Reviews

Recent Reviews

Countries Available