← Back to discovery

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Prasad Raghavendra

2003296 pagesabout 5–7 hours
2003
first published
  • 2003Springer London, Limited · ENGISBN 9783540451983
  • 2003Springer London, Limited · 296 pages · ENGISBN 9783540446668
  • 2004Springer London, Limited · ENGISBN 9783540278214
  • 2005Springer London, Limited · ENGISBN 9783540318743
  • 2006Springer London, Limited · ENGISBN 9783540380450
  • 2007Springer London, Limited · ENGISBN 9783540742081
  • 2009Springer London, Limited · ENGISBN 9783642036859
  • 2013Springer · 730 pagesISBN 9783642403279

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.

How do you feel?