Stock Image

The Steiner Ratio

Dietmar Cieslik

Published by Springer
ISBN 10: 0792370155 / ISBN 13: 9780792370154
New / Hardcover / Quantity Available: 20
From BuySomeBooks (Las Vegas, NV, U.S.A.)
Available From More Booksellers
View all  copies of this book
Add to basket
List Price: US$
Price: US$ 259.34
Convert Currency
Shipping: US$ 3.95
Within U.S.A.
Destination, Rates & Speeds

30 Day Returns Policy

Save for Later

About the Book

Bibliographic Details


Title: The Steiner Ratio

Publisher: Springer

Binding: Hardcover

Book Condition: New

Book Type: Hardcover

Description:

Hardcover. 256 pages. Dimensions: 9.5in. x 6.3in. x 0.7in.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. This item ships from multiple locations. Your book may arrive from Roseburg,OR, La Vergne,TN. Bookseller Inventory # 9780792370154

About this title:

Book ratings provided by GoodReads:
0 avg rating
(0 ratings)

Synopsis: 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.

"About this title" may belong to another edition of this title.

Bookseller & Payment Information

Payment Methods

This bookseller accepts the following methods of payment:

  • American Express
  • MasterCard
  • Visa

[Search this Seller's Books]

[List this Seller's Books]

[Ask Bookseller a Question]

Bookseller: BuySomeBooks
Address: Las Vegas, NV, U.S.A.

AbeBooks Bookseller Since: May 21, 2012
Bookseller Rating: 5-star rating

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days.

BuySomeBooks is operated by Drive-On-In, Inc., a Nevada co...

[More Information]

Shipping Terms:

Orders usually ship within 1-2 business days. Books are shipped from multiple locations so your order may arrive from Las Vegas,NV, Roseburg,OR, La Vergne,TN, Momence,IL, or Commerce,GA.


Store Description: BuySomeBooks is great place to get your books online. With over eight million titles available we're sure to have what you're looking for. Despite having a large selection of new books available for immediate shipment and excellent customer service, people still tell us they prefer us because of our prices.