International Conference on Approximation Algorithms for Combinatorial Optimization Problems

APPROX 2024

Important Deadlines:

  • Submissions: May 10, 2024, AoE Time Zone
  • Notifications: July 1, 2024
  • Camera Ready: July 15, 2024

Submission Format

Submissions, in PDF, should start with the title of the paper and details of the author(s), followed by a 1-2 paragraph abstract summarizing the paper’s contributions. This should be followed by a technical exposition on single-spaced, single-column pages, letter-size paper, using page numbers, at least 1-inch margins all around, and at least 11-point font. The first 10 pages should contain a clear presentation of the main technical and conceptual ideas underlying the results, including the motivation behind the paper and a clear comparison with related work (not including the references). The submission should be accessible to a wide variety of researchers in theoretical computer science and discrete mathematics. There is no page limit, but any material beyond the first 10 pages will be read at the sole discretion of the program committee.


Work that has been previously published in another conference proceedings or journal, or which will be published before the end of the conference, will not be considered for acceptance. Simultaneous submission of the same (or an overlapping) paper to RANDOM/APPROX and to another conference with published proceedings is not allowed.

Program Committee

  • Susanne Albers, Technical University of Munich
  • Keerti Choudhary, Indian Institute of Technology Delhi
  • Debarati Das, Pennsylvania State University
  • Thomas Erlebach, Durham University
  • Zhiyi Huang, University of Hong Kong
  • Sanjeev Khanna, University of Pennsylvania
  • Amit Kumar (PC Chair), Indian Institute of Technology Delhi
  • Euiwoong Lee, University of Michigan
  • Roie Levin, Rutgers University
  • Anand Louis, Indian Institute of Science Bangalore
  • Julián Mestre, University of Sydney
  • Sahil Singla, Georgia Institute of Technology
  • Thomas Rothvoss, University of Washington
  • José Verschae, Pontificia Universidad Católica de Chile
  • Erik Waingarten, University of Pennsylvania
  • David Wajc, Technion–Israel Institute of Technology

Scope

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