| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Co 2003 Edition Contributor(s): Arora, Sanjeev (Editor), Jansen, Klaus (Editor), Rolim, Jose D. P. (Editor) |
|
 |
ISBN: 3540407707 ISBN-13: 9783540407706 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: August 2003 Annotation: 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. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Mathematics | Discrete Mathematics - Mathematics | Applied |
| Dewey: 005.1 |
| LCCN: 2003059069 |
| Series: Lecture Notes in Computer Science, |
| Physical Information: 0.86" H x 6.14" W x 9.21" (1.30 lbs) 411 pages |
| Descriptions, Reviews, Etc. |
| Publisher 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. |