Items related to The Steiner Ratio
Steiner's 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. Steiner's 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.
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.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2001
- ISBN 10 0792370155
- ISBN 13 9780792370154
- BindingHardcover
- Number of pages256
Buy New
Learn more about this copy
US$ 111.44
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Seller Image
The Steiner Ratio by Cieslik, Dietmar [Hardcover ]
Seller:
Rating
Book Description Hardcover. Condition: new. Seller Inventory # 9780792370154
Buy New
US$ 111.44
Convert currency
Stock Image
The Steiner Ratio
Published by
Springer
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. Seller Inventory # ABLIING23Feb2416190184169
Buy New
US$ 116.18
Convert currency
Stock Image
The Steiner Ratio
Published by
Springer
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9780792370154_lsuk
Buy New
US$ 125.16
Convert currency
Seller Image
The Steiner Ratio
Published by
Springer US
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Steiner s 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 b. Seller Inventory # 5969855
Buy New
US$ 101.15
Convert currency
Stock Image
The Steiner Ratio
Published by
Springer
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: > 20
Seller:
Rating
Book Description Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9780792370154
Buy New
US$ 148.65
Convert currency
Seller Image
The Steiner Ratio
Published by
Springer US
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: 1
Seller:
Rating
Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Steiner's 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. Steiner's 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. Seller Inventory # 9780792370154
Buy New
US$ 124.86
Convert currency
Seller Image
The Steiner Ratio
Published by
Springer US Aug 2001
(2001)
ISBN 10: 0792370155
ISBN 13: 9780792370154
New
Hardcover
Quantity: 2
Seller:
Rating
Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Steiner's 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. Steiner's 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. 260 pp. Englisch. Seller Inventory # 9780792370154
Buy New
US$ 152.48
Convert currency