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
    Advances in Steiner Trees

Advances in Steiner Trees

Ding-Zhu Du
    Product form
      FORMAT: Paperback / softback

      R 3,043.63 Price and availability exclusive to website

      YOU COULD EARN 3,043.63 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 507.27 per month!
      3x monthly payments of R 1,014.54 with
      4x fortnightly payments of R 760.90 with
      The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
      Format: Paperback / softback CONTRIBUTORS: Ding-Zhu Du EAN: 9781441948243 COUNTRY: United States PAGES: WEIGHT: 516 g HEIGHT: 240 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2010-12-07 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Combinatorics WIDTH: 160 cm SPINE:

      Book Themes:

      Discrete mathematics, Optimization, Algorithms and data structures, Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. The second section of the book includes papers on the Steiner problem on graphs. The general geometric Steiner tree problem assumes that you have a given set of points in some d-dimensional space and you wish to connect the given points with the shortest network possible. The given set ofpoints are 3 Figure 1: Euclidean Steiner Problem in E usually referred to as terminals and the set ofpoints that may be added to reduce the overall length of the network are referred to as Steiner points. What makes the problem difficult is that we do not know a priori the location and cardinality ofthe number ofSteiner points. Thus)the problem on the Euclidean metric is not known to be in NP and has not been shown to be NP-Complete. It is thus a very difficult NP-Hard problem.
      Format: Paperback / softback CONTRIBUTORS: Ding-Zhu Du EAN: 9781441948243 COUNTRY: United States PAGES: WEIGHT: 516 g HEIGHT: 240 cm
      PUBLISHED BY: Springer-Verlag New York Inc. DATE PUBLISHED: 2010-12-07 CITY: GENRE: COMPUTERS / Computer Science, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied, MATHEMATICS / Combinatorics WIDTH: 160 cm SPINE:

      Book Themes:

      Discrete mathematics, Optimization, Algorithms and data structures, Mathematical theory of computation

      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