11th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2008
12th Intl. Workshop on Randomization and Computation - RANDOM 2008
25-27 August 2008, MIT
Boston, USA

The 11th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2008), and the 12th. International Workshop on Randomized Techniques in Computation (RANDOM'2008) will be held at the Kiva-Patil seminar room, Building 32 (Ray and Maria Stata Center) - MIT, on August 25-27, 2008.

APPROX'2008 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2008 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2008 is the twelfth workshop in the series; APPROX'2008 is the eleventh in the series.

Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:

• design and analysis of approximation algorithms
• hardness of approximation
• small space, sub-linear time, and streaming
• algorithms
• embeddings and metric space methods
• mathematical programming methods
• combinatorial problems in graphs and networks
• game theory, markets, and economic applications
• geometric problems
• packing, covering, and scheduling
• approximate learning
• other applications

• 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