Important dates

  • Submissions: May 4, 2023 (18:00 EST)
  • Notifications: June 26, 2023
  • Camera ready: July 10, 2023


APPROX focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems. Papers are solicited in all research areas related to 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
  • algorithmic game theory, mechanism design and economics
  • computational geometric problems
  • approximate learning

Program committee

  • Marcin Bieńkowski, University of Wrocław
  • Yuri Faenza, Columbia University
  • Chien-Chung Huang, École Normale Supérieure
  • Sami Davies, Northwestern University
  • Naveen Garg, Indian Institute of Technology Delhi
  • Anupam Gupta, Carnegie Mellon University
  • Arindam Khan, Indian Institute of Science
  • Nicole Megow (PC chair), University of Bremen
  • Seffi Naor, Technion
  • Britta Peis, RWTH Aachen University
  • Lars Rohwedder, Maastricht University
  • Melanie Schmidt, Heinrich Heine University Düsseldorf       
  • David Shmoys, Cornell University
  • Mohit Singh, Georgia Institute of Technology
  • Tami Tamir, Reichman University

Local organization

  • Santosh Vempala (chair)
  • Sahil Singla (co-chair)
  • Will Perkins (co-chair)