Program Committee


Nikhil Bansal
Chandra Chekuri
Eden Chlamtac
Nikhil Devanur
Uriel Feige
Claire Mathieu
Ankur Moitra
Seffi Naor
Yuval Rabani
Prasad Raghavendra (chair)
Roy Schwartz
Mohit Singh
Ola Svensson
Mohammadtaghi Hajiaghayi
Madhur Tulsiani
Rico Zenklusen


Amit Chakrabarti
Nikolaos Fountoulakis
Ariel Gabizon
Parikshit Gopalan
Dan Gutfreund
Prahladh Harsha
Thomas Hayes
Michael Krivelevich
Shachar Lovett
Russell Martin
Dieter van Melkebeek
Sofya Raskhodnikova(Chair)
Shubhangi Saraf
Christian Sohler
David P. Woodruff
Amir Yehudayoff

Program Chairs

Prasad Raghavendra,
University of California, Berkeley

Sofya Raskhodnikova,
Pennsylvania State University

Workshop Chairs

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

Notification to authors
June 11, 2013

Camera ready
June 18, 2013
Call for papers

Approx 2013 + Random 2013

UC Berkeley, USA
Aug.21-Aug.23 2013

The 16th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2013), and the 17th. International Workshop on Randomization and Computation (RANDOM'2013) will be held Aug.21-Aug.23 in UC Berkeley.

APPROX'2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2013 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2013 is the seventeenth workshop in the series; APPROX'2013 is the sixteenth 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 geometry
  • 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!

Created by Marios Karagiannis - Maintained by Eugenio Noto