Name: the steiner ratio
SKU: 3619678
Price: 3431.00 TWD
Availability: InStock
Author: cieslik
ISBN: 9780792370154

Select your country

Americas

Europe

Rest of the world

Type

Physical Book

Publisher

Springer

Author

cieslik

Language

English

Pages

256

ISBN

0792370155

ISBN13

9780792370154

Synopsis "the steiner ratio"

steiners problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. a solution must be a tree, which is called a steiner minimal tree (smt), and may contain vertices different from the points which are to be connected. steiners problem is one of the most famous combinatorial-geometrical problems, but unfortunately it is very difficult in terms of combinatorial structure as well as computational complexity. however, if only a minimum spanning tree (mst) without additional vertices in the interconnecting network is sought, then it is simple to solve. so it is of interest to know what the error is if an mst is constructed instead of an smt. the worst case for this ratio running over all finite sets is called the steiner ratio of the space. the book concentrates on investigating the steiner ratio. the goal is to determine, or at least estimate, the steiner ratio for many different metric spaces. the author shows that the description of the steiner ratio contains many questions from geometry, optimization, and graph theory. audience: researchers in network design, applied optimization, and design of algorithms.