Program Committee


Alexandr Andoni
Yossi Azar
Shuchi Chawla
Anupam Gupta (chair)
Sariel Har-Peled
Jochen Koenemann
Amit Kumar
Lap Chi Lau
Konstantin Makarychev
Monaldo Mastrolilli
Dana Moshkovitz
Rene Sitters
David Steurer
Kunal Talwar
Jan Vondrak
Lisa Zhang


Eli Ben-Sasson
Andrej Bogdanov
Mark Braverman
Colin Cooper
Tobias Friedrich
Tali Kaufman
Raghu Meka
Jelani Nelson
Ilan Newman
Ryan O'Donnell
Konstantinos Panagiotou
Prasad Raghavendra
Atri Rudra
Rocco Servedio (chair)
Alistair Sinclair
Emanuele Viola

Program Chairs

Anupam Gupta,
Carnegie Mellon University

Rocco Servedio,
Columbia University

Workshop Chairs

José Rolim,
U. of Geneva
Klaus Jansen,
U. of Kiel
Important dates
Submission deadline
April 20, 2012

Notification to authors
June 8, 2012

Camera ready
June 15, 2012

August 15-17, 2012
Call for papers
Thank you

The Random/Approx organization would like to thank Microsoft Research New England for their support.

Approx 2012 + Random 2012

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:

  • 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

Valid XHTML 1.0 Transitional Valid CSS!

Maintained by Marios Karagiannis