License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2019.2
URN: urn:nbn:de:0030-drops-117886
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/11788/
Censor-Hillel, Keren
Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract)
Abstract
We know that exact distributed algorithms for optimization problems cannot be fast. To overcome these barriers, very efficient approximation algorithms have been designed in various distributed settings. But for very small approximation factors, a mystery remains: Why do we not have fast distributed algorithms for very small approximations factors in bandwidth restricted settings?
This talk will overview the state-of-the-art of distributed optimization and approximation algorithms and discuss the major challenges in determining the complexity of small approximations.
BibTeX - Entry
@InProceedings{censorhillel:LIPIcs:2020:11788,
author = {Keren Censor-Hillel},
title = {{Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract)}},
booktitle = {23rd International Conference on Principles of Distributed Systems (OPODIS 2019)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-133-7},
ISSN = {1868-8969},
year = {2020},
volume = {153},
editor = {Pascal Felber and Roy Friedman and Seth Gilbert and Avery Miller},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/11788},
URN = {urn:nbn:de:0030-drops-117886},
doi = {10.4230/LIPIcs.OPODIS.2019.2},
annote = {Keywords: Distributed graph algorithms, Optimization and approximations}
}
Keywords: |
|
Distributed graph algorithms, Optimization and approximations |
Collection: |
|
23rd International Conference on Principles of Distributed Systems (OPODIS 2019) |
Issue Date: |
|
2020 |
Date of publication: |
|
11.02.2020 |