Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [electronic resource] : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012, Proceedings /
International Workshop on Randomization and Approximation Techniques in Computer ScienceCorporate Author
International Workshop on Randomization and Approximation Techniques in Computer Science(15th :2012 :Cambridge, Mass.)
International Workshop on Randomization and Approximation Techniques in Computer Science
Gupta, Anupam.editor.
Jansen, Klaus.editor.
Rolim, José D.P.editor.
SERVEDIO, ROCCO.editor.
This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. 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.
Bibliographic Level Mode of Issuance: Monograph
Includes bibliographical references and index.
This book constitutes the joint refereed proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2012, and the 16th International Workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. 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.
Algorithms.
Computer science—Mathematics.
Computers.
Numerical analysis.
Mathematical statistics.
Optical data processing.
Algorithm Analysis and Problem Complexity.
Discrete Mathematics in Computer Science.
Computation by Abstract Devices.
Numeric Computing.
Probability and Statistics in Computer Science.
Computer Imaging, Vision, Pattern Recognition and Graphics.