24th International Conference on Approximation Algorithms for Combinatorial Optimization Problems

США, Сиэтл

16 августа18 августа 2021

Форма участия: Дистанционная

Срок подачи заявок: 04.05.2021

Повысить рейтинг

Повышение рейтинга дает возможность оставаться объявлению в топе на главной странице, а также на страницах городов, тематик, связанных с объявлением.

Текущее значение: 0

Topics
Papers are solicited in all research areas related to approximation, including but not limited to: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

IMPORTANT DATES Submissions: May 4, 2021
Notifications: June 23, 2021
Camera ready: July 12, 2021

PROCEEDINGS
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.

Смотреть похожие мероприятия

Shopping Cart