Ashish G. Approximation, Randomization...Optimization 2008

Textbook in PDF format

This volume contains the papers presented at the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (Approx 2008) and the 12th International Workshop on Randomization and Computation (Random 2008), which took place concurrently at the MIT (Massachusetts Institute of Technology) in Boston, USA, during August 25–27, 2008.
Topics of interest for Approx and Random are: design and analysis of approximation algorithms, hardness of approximation, small space, sub-linear time, streaming, algorithms, embeddings and metric space methods, mathematical programming methods, combinatorial problems in graphs and networks, game theory, markets, economic applications, geometric problems, packing, covering, scheduling, approximate learning, design and analysis of randomized algorithms, randomized complexity theory, pseudorandomness and derandomization, random combinatorial structures, random walks/Markov chains, expander graphs and randomness extractors, probabilistic proof systems, random projections and embeddings, error-correcting codes, average-case analysis, property testing, computational learning theory, and other applications of approximation and randomness