Program Committee


Niv Buchbinder
Deeparnab Chakrabarty
Siu On Chan
Shuchi Chawla
Eden Chlamtac
Nikhil Devanur (chair)
Alina Ene
Konstantinos Georgiu
Telikepalli Kavitha
Ken Ichi Kawarabayashi
Jochen Koenemann
Amit Kumar
Konstantin Makarychev
Debmalya Panigrahi
Thomas Rothvoss
Barna Saha
Bruce Shepherd
Aravind Srinvasan
David Williamson


Louigi Addario-Berry
Nayantara Bhatnagar
Amin Coja-Oghlan
David Galvin
Valentine Kabanets
Michael Molloy
Cris Moore (chair)
Assaf Naor
Krzysztof Onak
Dana Ron
Alex Russell
Dominik Scheder
Devavrat Shah
Perla Sousi
Mario Szegedy
Amnon Ta-Shma
Thomas Vidick

Program Chairs

Nikhil Devanur,
Microsoft Research, Redmond

Cris Moore,
Santa Fe Institute

Workshop Chairs

José Rolim,
U. of Geneva
Klaus Jansen,
U. of Kiel

Organizing Comitee Chair

Carme Alvarez,
Universitat Politècnica de Catalunya
Important dates
Submission deadline
April 17, 2014

Notification to authors
June 6, 2014

Camera ready
June 20, 2014
Call for papers

Approx 2014 + Random 2014

UPC Barcelona
Sep.4-Sep.6 2014

The 17th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2014), and the 18th. International Workshop on Randomization and Computation (RANDOM'2014) will be held will be held in 4-6 September 2014 at Barcelona.

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

  • Universitat Politècnica de Catalunya (UPC)
  • Departament de Llenguatges i Sistemes Informàtics (LSI)
  • ALBCOM Research Group (ALBCOM)
Organizing committee:
  • Carme Àlvarez, UPC (Chair)
  • Maria Blesa, UPC
  • Amalia Duch, UPC
  • Maria Serna, UPC
Conference News!

4.9.2014 :

The proceedings volume of APPROX/RANDOM'14 as volume 28 of LIPIcs is now officially published here: proceedings


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

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


Abstract Format: Electronic submissions are solicited. Please consult the following servers:

For submission of APPROX papers:
Click here

For submission of RANDOM papers:
Click here

Note: You will be asked to login using an EasyChair account. Directions on how to register for such an account are available at the submission servers (you may also have an old account from a previous conference submission).
The submission must be received by 17:00pm (PDT) of April 17 for your submission to be considered.

Submission Format: Submissions should start with the title of the paper, each author`s name, affiliation, and e-mail address, followed by a one-paragraph summary of the results to be presented. This should then be followed by a technical exposition on single-spaced pages on letter-size paper, using reasonable margins and at least 11-point font. The first 10 pages should contain the main ideas and techniques used to achieve the results including motivation and a clear comparison with related work (not including the references). There is no page limit but any material beyond the first 10 pages will be read at the sole discretion of the program committee.


Accepted papers will be published in the online proceedings of the conference in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work. Further detail will be available early January at the conference website.