Workshop on Approximation and Online Algorithms

Страна: Австрия

Город: Vienna

Тезисы до: 27.06.2017

Даты: 07.09.17 — 08.09.17

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

Е-мейл Оргкомитета:

Организаторы: Institut für Computergraphik und Algorithmen an der Technischen Universität


Approximation and online algorithms are fundamental tools to deal with computationally hard problems and problems in which the input is gradually disclosed over time. Both kinds of problems arise from a large number of applications in a variety of fields. The workshop focuses on the design and analysis of approximation and online algorithms. It also covers experimental methods used to design and analyze efficient approximation and online algorithms.

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

    graph algorithms
    inapproximability results
    network design
    packing and covering
    paradigms for the design and analysis of approximation and online algorithms
    parameterized complexity
    scheduling problems
    algorithmic game theory
    algorithmic trading
    coloring and partitioning
    competitive analysis
    computational advertising
    computational finance
    cuts and connectivity
    geometric problems
    mechanism design
    resource augmentation
    real-world applications


Веб-сайт конференции:

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