Navigation

Program Committee




APPROX

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

RANDOM

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


APPROX
R. Ravi,
Carnegie Mellon University
email:
ravi@cmu.edu

RANDOM
Leslie Goldberg,
University of Liverpool
email:
L.A.Goldberg@liverpool.ac.uk

Workshop Chairs


José Rolim,
U. of Geneva
e-mail: jose.rolim@unige.ch
Klaus Jansen,
U. of Kiel
e-mail: kj@informatik.uni-kiel.de
Important dates
Submission deadline
April 15, 2011

Notification to authors
June 8, 2011

Camera ready
June 17, 2011

Conference
August 17-19, 2011
Call for papers

Approx 2011 + Random 2011

Princeton University
Aug. 17-19, 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. 17-19, 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, 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


Valid XHTML 1.0 Transitional Valid CSS!

Maintained by Marios Karagiannis