Navigation

Program Committee


APPROX

Anna Adamaszek (Copenhagen)
Shiri Chechik (Tel Aviv)
Anne Driemel (TUE)
Lee-Ad Gottlieb (Ariel)
Varun Kanade (Oxford)
Nitish Korula (Google)
Stefano Leonardi (Sapienza)
Daniel Lokshtanov (Bergen)
Claire Mathieu (ENS Paris, chair)
Nicole Megow (TUM)
Tobias Moemke (Saarland)
Shayan Oveis Gharan (Washington)
Debmalya Panigrahi (Duke)
Richard Peng (Georgia Tech)
Ely Porat (Bar-Ilan)
Adi Rosén (CNRS & Paris 7)
Adrian Vetta (McGill)
Rico Zenklusen (ETH Zurich)

RANDOM

Mahdi Cheraghchi (Imperial College, London)
Elena Grigorescu (Purdue)
Neeraj Kayal (MSR Bangalore)
Adam Klivans (Austin)
Swastik Kopparty (Rutgers)
Ravi Kumar (Google)
Dana Moshkovitz (MIT)
Ashwin Nayak (Waterloo)
Ryan O'Donnell (CMU)
Asaf Shapira (Tel Aviv)
Ronen Shaltiel (Haifa)
Alexander Sherstov (UCLA)
Thomas Thierauf (Aalen)
Chris Umans (Caltech, chair)
Eric Vigoda (Georgia Tech)

Program Chairs


APPROX
Claire Mathieu
CNRS and École Normale Supérieure Paris
cmathieu@di.ens.fr

RANDOM
Chris Umans
Caltech
umans@cs.caltech.edu

Workshop Chairs


José Rolim,
U. of Geneva
jose.rolim@unige.ch
Klaus Jansen,
U. of Kiel
kj@informatik.uni-kiel.de
                                                      


Local Organisation


Sophie Laplante
Frédéric Magniez
Marc Renault
Adi Rosén, chair                                            

Dakini
Important dates
Submission deadline
Tues, April 19, 2016
15:00 PDT


Notification to authors
By June 22, 2016

Camera ready
July 1, 2016

Conference
Sept 7-9, 2016
Call for papers
IRIF

CNRS

Université Paris Diderot - Paris 7

FILOFOCS

IHP

Approx 2016 + Random 2016

Institut Henri Poincaré (IHP) - Paris, France
Wed, Sept 7 - Fri, Sept 9, 2016


The 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2016), and the 20th International Workshop on Randomization and Computation (RANDOM'2016) will be held on the 7 - 9 of September 2016 at the Institut Henri Poincaré in Paris, organized by IRIF (CNRS and Université Paris Diderot).

APPROX'2016 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2016 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2016 is the twentieth workshop in the series; APPROX'2016 is the nineteenth in the series.



Proceedings

The online proceedings of the conference can be found at: http://www.dagstuhl.de/dagpub/978-3-95977-018-7

Topics

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

APPROX
  • 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
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!

Created by Marios Karagiannis - Maintained by Marc Renault and Orestis Evangelatos