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

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Sanjeev Arora
    Product form
      FORMAT: Paperback / softback

      R 2,015.00 Price and availability exclusive to website

      YOU COULD EARN 2,015 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 335.83 per month!
      3x monthly payments of R 671.66 with
      4x fortnightly payments of R 503.75 with
      This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.
      Format: Paperback / softback CONTRIBUTORS: Sanjeev Arora EAN: 9783540407706 COUNTRY: Germany PAGES: WEIGHT: 1310 g HEIGHT: 233 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2003-08-13 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Numerical analysis, Optimization, Algorithms and data structures, Software Engineering, Maths for computer scientists

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      This book constitutes the joint refereed proceedings of the 6th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2003 and of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, held in Princeton, NY, USA in August 2003.The 33 revised full papers presented were carefully reviewed and selected from 74 submissions. Among the issues addressed are design and analysis of randomized and approximation algorithms, online algorithms, complexity theory, combinatorial structures, error-correcting codes, pseudorandomness, derandomization, network algorithms, random walks, Markov chains, probabilistic proof systems, computational learning, randomness in cryptography, and various applications.
      Format: Paperback / softback CONTRIBUTORS: Sanjeev Arora EAN: 9783540407706 COUNTRY: Germany PAGES: WEIGHT: 1310 g HEIGHT: 233 cm
      PUBLISHED BY: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG DATE PUBLISHED: 2003-08-13 CITY: GENRE: COMPUTERS / Data Science / General, COMPUTERS / Software Development & Engineering / General, COMPUTERS / Programming / Algorithms, MATHEMATICS / Applied WIDTH: 155 cm SPINE:

      Book Themes:

      Discrete mathematics, Numerical analysis, Optimization, Algorithms and data structures, Software Engineering, 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