Massachusetts Institute of Technology (M.I.T.)
Boston, USA
Aug.15-Aug.17 2012

The 15th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2012), and the 16th. International Workshop on Randomization and Computation (RANDOM'2012) will be held Aug.15-Aug.17 in Massachusetts Institute of Technology (M.I.T.).

APPROX'2012 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2012 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2012 is the sixteenth workshop in the series; APPROX'2012 is the fifteenth in the series.
Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:

APPROX

• 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

RANDOM

• 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