menu
{ "item_title" : "Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques", "item_author" : [" Sanjeev Arora", "Klaus Jansen", "Jose D. P. Rolim "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/3/54/040/770/3540407707_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques|Sanjeev Arora

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 6th International Workshop on Approximation Algorithms for Co

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9783540407706
  • ISBN-10: 3540407707
  • Publisher: Springer
  • Publish Date: August 2003
  • Dimensions: 9.21 x 6.14 x 0.86 inches
  • Shipping Weight: 1.3 pounds
  • Page Count: 411

Related Categories

You May Also Like...

    1

BAM Customer Reviews