Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Raghavendra, Prasad (Επιμελητής έκδοσης), Raskhodnikova, Sofya (Επιμελητής έκδοσης), Jansen, Klaus (Επιμελητής έκδοσης), Rolim, José D. P. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2013.
• Σειρά: Lecture Notes in Computer Science, 8096
• Θέματα: Computer science.; Data structures (Computer science).; Computers.; Algorithms.; Numerical analysis.; Computer science > Mathematics.; Mathematical statistics.; Computer Science.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Computation by Abstract Devices.; Numeric Computing.; Probability and Statistics in Computer Science.; Data Structures.
• Φυσική περιγραφή: XIV, 716 p. 48 illus. online resource.
• ISBN: 9783642403286
• ISSN: 0302-9743 ;

This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.