Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Dinur, Irit. (Editor), Jansen, Klaus. (Editor), Naor, Joseph. (Editor), Rolim, Jos.̌ (Editor)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
• Series: Lecture Notes in Computer Science, 5687
• Subjects: Computer science.; Coding theory.; Computer software.; Electronic data processing.; Computational complexity.; Algebra > Data processing.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Numeric Computing.; Symbolic and Algebraic Manipulation.; Probability and Statistics in Computer Science.; Coding and Information Theory.
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-03685-9

 This book constitutes the joint refereed proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2009, and the 13th International Workshop on Randomization and Computation, RANDOM 2009, held in Berkeley, CA, USA, in August 2009. The 25 revised full papers of the APPROX 2009 workshop and the 28 revised full papers of the RANDOM 2009 workshop included in this volume, were carefully reviewed and selected from 56 and 58 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.