@inproceedings{bb7cef7f38c349f8a7eaa30a6dc5495d,
title = "Distributed optimization and approximation: How difficult can it be?",
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.",
keywords = "And phrases Distributed graph algorithms, Approximations, Optimization",
author = "Keren Censor-Hillel",
note = "Publisher Copyright: {\textcopyright} Keren Censor-Hillel; licensed under Creative Commons License CC-BY 23rd International Conference on Principles of Distributed Systems (OPODIS 2019).; 23rd International Conference on Principles of Distributed Systems, OPODIS 2019 ; Conference date: 17-12-2019 Through 19-12-2019",
year = "2020",
month = feb,
doi = "10.4230/LIPIcs.OPODIS.2019.2",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Pascal Felber and Roy Friedman and Seth Gilbert and Avery Miller",
booktitle = "23rd International Conference on Principles of Distributed Systems, OPODIS 2019",
}