2026-07-23T04:53:45Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11788 2024-03-06T10:48:46Z ddc:004 open_access

Distributed Optimization And Approximation: How Difficult Can It Be? (Keynote Abstract) Censor-Hillel, Keren Distributed graph algorithms Optimization and approximations 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Keren Censor-Hillel 2020 Is Part Of LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2019.2 urn:nbn:de:0030-drops-117886 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.2 eng https://creativecommons.org/licenses/by/3.0/legalcode