FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Steiner Ratio

Steiner Ratio

Dietmar Cieslik
    Product form
      FORMAT: Hardback

      R 3,030.56 Price and availability exclusive to website

      YOU COULD EARN 3,030.56 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 505.09 per month!
      3x monthly payments of R 1,010.18 with
      4x fortnightly payments of R 757.64 with
      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.
      Format: CONTRIBUTORS: Dietmar Cieslik EAN: 9780792370154 COUNTRY: Netherlands PAGES: WEIGHT: 1200 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 2001-08-31 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / Analytic WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Geometry, Optimization, Algorithms and data structures, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      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.
      Format: CONTRIBUTORS: Dietmar Cieslik EAN: 9780792370154 COUNTRY: Netherlands PAGES: WEIGHT: 1200 g HEIGHT: 235 cm
      PUBLISHED BY: Springer DATE PUBLISHED: 2001-08-31 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Geometry / Analytic WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Geometry, Optimization, Algorithms and data structures, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account