Princeton University
Mon, August 20 - Wed, August 22, 2018
The 21st International Conference on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'2018), and the 22nd International Conference on Randomization and Computation (RANDOM'2018) will be held on the 20-22 of August 2018 at Princeton University, New Jersey
.
APPROX'2018 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM'2018 focuses on applications of randomness to computational and combinatorial problems. RANDOM'2018 is the twenty-second conference in the series; APPROX'2018 is the twenty-first in the series.
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
- smoothed analysis
- property testing
- computational learning theory