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, Princeto, NY, USA, August 24-26,2003

411 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• ISBN: 9783540407706
• Sprache: Englisch
• Erscheinungsdatum: 13.08.2003
• Genre: Informatik, EDV/Informatik
• Verlag: Springer Berlin
• Herausgegeben von: Sanjeev Arora, Klaus Jansen, Jose D.P. Rolim, Amit Sahai