Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Author :
Publisher : Springer
Total Pages : 411
Release :
ISBN-10 : 9783540451983
ISBN-13 : 3540451986
Rating : 4/5 (986 Downloads)

Book Synopsis Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques by : Sanjeev Arora

Download or read book Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques written by Sanjeev Arora and published by Springer. This book was released on 2003-12-15 with total page 411 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.


Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Related Books