Program Committee


Julia Chuzoy
Naveen Garg
Michel Goemans
Fabrizio Grandoni
Anupam Gupta
Prahalad Harsha
Satoru Iwata
Philip Klein
Robert Krauthgammer
Kamesh Munagala
Zeev Nutov
R. Ravi (chair)
Guido Schaefer
Chaitanya Swamy
Kunal Talwar
Gerhard Woeginger


Per Austrin
Nayantara Bhatnagar
Amin Coja-Oghlan
Josep Diaz
Benjamin Doerr
Devdatt Dubhashi
Martin Dyer
Tom Friedetzky
Leslie Goldberg (chair)
Mark Jerrum
Elitza Maneva
Allan Sly
Eli Upfal
Juan Vera
Osamu Watanabe
David Zuckerman

Program Chairs

R. Ravi,
Carnegie Mellon University

Leslie Goldberg,
University of Liverpool

Workshop Chairs

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

Notification to authors
June 8, 2011

Camera ready
June 17, 2011

August 17-19, 2011
Call for papers


Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers:
For submission of RANDOM papers:

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).

The submission must be received by 17:00pm (PDT) of April 15 for your submission to be considered.
Abstract Format: Authors should submit an extended abstract (not a full paper). An abstract should start with the title of the paper, each author's name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented.
This should then be followed by a technical exposition of the main ideas and techniques used to achieve these results including motivation and a clear comparison with related work. The abstract should not exceed 10 single-spaced pages on letter-size paper, using reasonable margins and at least 11-point font (not including the references). If the authors believe that more details are essential to substantiate the main claims of the paper, they may include a clearly marked appendix that will be read at the discretion of the program committee.

Simultaneous submission to other conferences with published proceedings is not allowed.


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 derandomi-zation
  • 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