Approx 2011 + Random 2011
Princeton University
Aug. 1719, 2011
The 14th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2011), and the 15th. International Workshop on Randomization and Computation (RANDOM'2011) will be held in Princeton University, in Aug. 1719, 2011.
APPROX'2011 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2011 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2011 is the fifteenth workshop in the series; APPROX'2011 is the fourteenth in the series.
Topics
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, sublinear 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
 errorcorrecting codes
 averagecase analysis
 property testing
 computational learning theory
