12th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2009
13th Intl. Workshop on Randomization and Computation - RANDOM 2009
21-23 August 2009, HP Auditorium
UC Berkeley, USA

The 12th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2009), and the 13th. International Workshop on Randomized Techniques in Computation (RANDOM'2009) will be held at the HP Auditorium/306 Soda Hall, UC Berkeley, on August 21-23, 2009.

APPROX'2009 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2009 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2009 is the thirteenth workshop in the series; APPROX'2009 is the twelvth 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
• design and analysis of online algorithms
• 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