Princeton University
Aug.24-Aug.26 2015

The 18th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2015), and the 19th. International Workshop on Randomization and Computation (RANDOM'2015) will be held will be held in 24-26 August 2015 at Princeton University.

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

11.8.2015 :

See the Map for those coming to the conference by car. You can park your car at the LOT 21 and use the shuttle service to access the campus.

30.7.2015 :

See the DIMACS website for the DIMACS workshop located at the Rutgers University on August 27-28!

14.7.2015 :

See the Accommodation for news!

2.7.2015 :

The program now is on-line!


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

APPROX

• 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

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