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 /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Arora, Sanjeev (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Jansen, Klaus (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Rolim, Jose D.P (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Sahai, Amit (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2764
• Θέματα: Software engineering.; Mathematical optimization.; Algorithms.; Numerical analysis.; Computer science-Mathematics.; Software Engineering/Programming and Operating Systems.; Optimization.; Algorithm Analysis and Problem Complexity.; Numeric Computing.; Discrete Mathematics in Computer Science.
• Φυσική περιγραφή: IX, 411 p. online resource.
• ISBN: 9783540451983
• ISSN: 0302-9743 ;
• DOI: 10.1007/b11961

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.