APPROX 2021

  • The conference will be held August 16-18, together with RANDOM 2021, and will be completely virtual.

Important dates

  • Submissions: May 4, 2021, 15:00 PDT
  • Notifications: June 23, 2021
  • Camera ready: July 12, 2021

Scope

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

  • Umang Bhaskar, Tata Institute of Fundamental research
  • Gwenaël Joret, Université libre de Bruxelles
  • Naonori Kakimura, Keio University
  • Jochen Könemann, University of Waterloo
  • Michael Lampis, University of Paris Dauphine
  • Shi Li, University at Buffalo
  • Tobias Mömke, University of Augsburg
  • Viswanath Nagarajan, University of Michigan
  • Jesper Nederlof, Utrecht University
  • Alantha Newman, University of Grenoble
  • Debmalya Panigrahi, Duke University
  • Marcin Pilipczuk, University of Warsaw
  • Laura Sanità, TU Eindhoven, (PC chair)
  • Guido Schäfer, CWI & University of Amsterdam
  • Martin Skutella, TU Berlin
  • Andreas Wiese, University of Chile

Instructions for authors