

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
296 pages2006Springer London, LimitedISBN 9783540380450
Computer scienceComputer algorithmsApproximation theoryData structures (Computer science)Computer softwareElectronic data processingComputational complexityAlgorithm Analysis and Problem ComplexityDiscrete Mathematics in Computer ScienceComputation by Abstract DevicesNumeric ComputingProbability and Statistics in Computer ScienceData Structures
About this book
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.
Publication Details
- Publisher
- Springer London, Limited
- Published
- 2006
- Pages
- 296
- ISBN
- 9783540380450
More by Unknown Author

Structural Complexity II (Monographs in Theoretical Computer Science. An EATCS Series)
Unknown Author

Structural Complexity I (Texts in Theoretical Computer Science. An EATCS Series)
Unknown Author

Algorithms and Complexity
Unknown Author

Structural Complexity II
Unknown Author

Structural Complexity I
Unknown Author

Structural Complexity I
Unknown Author
Track your reading journey with BookOwl