Program Chairs

David Steurer
ETH, Zurich

Eric Blais
University of Waterloo, Canada

Workshop Chairs

José Rolim,
University of Geneva
Klaus Jansen,
University of Kiel

Program Committee


Parinya Chalermsook (Aalto)
Alina Ene (BU)
Fabrizio Grandoni (IDSIA)
Anupam Gupta (CMU)
Pravesh Kothari (Princeton and IAS)
Lap Chi Lau (Waterloo)
Euiwoong Lee (Simons Institute)
James Lee (UW)
Edo Liberty (Amazon)
Yury Makarychev (TTI)
Neil Olver (Amsterdam)
Yuval Rabani (HUJI)
Tselil Schramm (Harvard and MIT)
Roy Schwartz (Technion)
Noah Stephens-Davidowitz (Princeton)
David Steurer (ETH)
Inbal Talgam-Cohen (HUJI)
Aravindan Vijayaraghavan (Northwestern)
Justin Ward (Queens Mary)
Tony Wirth (Melbourne)
Grigory Yaroslavtsev (Indiana)


Eric Blais (U. Waterloo)
Joshua Brody (Swarthmore College)
Xi Chen (Columbia U.)
Gil Cohen (Princeton and Tel Aviv U.)
Andrew Drucker (U. Chicago)
Tom Gur (UC Berkeley)
Daniel Kane (UCSD)
Pravesh Kothari (Princeton U. and IAS)
Reut Levi (Weizmann Institute)
Aleksandar Nikolov (U. Toronto)
Lev Reyzin (U. Illinois Chicago)
Noga Ron-Zewi (Haifa U.)
Ron Rosenthal (Technion)
Atri Rudra (U. Buffalo)
Or Sheffet (U. Alberta)
Thomas Watson (U. Memphis)
Yuichi Yoshida (NII)
Important dates
Submission deadline
Friday, April 20, 2018
15:00 PDT

Notification to authors
By June 1, 2018

Camera ready
June 11, 2018

August 20-22, 2018
Call for papers

Approx 2018 + Random 2018

Princeton University
Mon, August 20 - Wed, August 22, 2018

The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2018), and the 22nd International Conference on Randomization and Computation (RANDOM'2018) will be held on the 20-22 of August 2018 at Princeton University, New Jersey .

APPROX'2018 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2018 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2018 is the twenty-second conference in the series; APPROX'2018 is the twenty-first in the series.


Papers are solicited in all research areas related to randomization and approximation, including, but not limited to:

  • approximation algorithms
  • hardness of approximation
  • small space, sub-linear time and streaming algorithms
  • online algorithms
  • approaches that go beyond worst case analysis
  • distributed and parallel approximation​
  • embeddings and metric space methods
  • mathematical programming methods
  • spectral methods
  • combinatorial optimization in graphs and networks
  • algorithmic game theory, mechanism design and economics
  • computational geometric problems
  • approximate learning
  • 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
  • smoothed analysis
  • property testing
  • computational learning theory