APPROX2019: The 22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems

Страна: США

Город: Cambridge

Тезисы до: 03.05.2019

Даты: 20.09.19 — 22.09.19

Область наук: Физико-математические;

Е-мейл Оргкомитета: optas@cs.ucsc.edu

Организаторы: International COmmittee

 

The 23rd International Workshop on Randomization and Computation (RANDOM’2019) and

the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’2019) will be held on Sep 20-22, 2019 at MIT.

RANDOM’2019 focuses on applications of randomness to computational and combinatorial problems, while APPROX’2019 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems.

TOPICS

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

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

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 
  • algorithmic game theory, mechanism design and economics
  • computational geometric problems
  • approximate learning

Веб-сайт конференции: https://approxconference.wordpress.com/

Конференции по теме - с близкими дедлайнами: