Approximation, Randomization, and Combinatorial Optimization Algorithms and Techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003: Proceedings
| Author/creator | Arora, Sanjeev Author |
| Format | Electronic |
| Publication Info | New York : Springer |
| Description | ix, 409 p. ill 23.500 x 015.500 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present) |
| Subjects |
| Series | Lecture Notes in Computer Science Ser. Vol. 2764 |
| Summary | 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. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2003059069 |
| ISBN | 9783540407706 |
| ISBN | 3540407707 (Trade Paper) Active Record |
| Standard identifier# | 9783540407706 |
| Stock number | 00024965 |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |