Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Serna, Maria. (Editor), Shaltiel, Ronen. (Editor), Jansen, Klaus. (Editor), Rolim, Jos.̌ (Editor)
• Format: Electronic
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Series: Lecture Notes in Computer Science, 6302
• Subjects: Computer science.; Computer Communication Networks.; Data structures (Computer science).; Computer software.; Computational complexity.; Computer graphics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Data Structures.; Computation by Abstract Devices.; Computer Graphics.
• Online Access: https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-15369-3
• Physical Description: XIII, 782p. 54 illus. online resource.
• ISBN: 9783642153693
• ISSN: 0302-9743

This book constitutes the joint refereed proceedings of the 13th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2010, and the 14th International Workshop on Randomization and Computation, RANDOM 2010, held in Barcelona, Spain, in September 2010. The 28 revised full papers of the APPROX 2010 workshop and the 29 revised full papers of the RANDOM 2010 workshop included in this volume, were carefully reviewed and selected from 66 and 61 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.