Fast distributed algorithms for Lp-type problems of low dimension

Kristian Hinnenthal, Christian Scheideler, Martijn Struijs

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Downloads (Pure)

Abstract

In this paper we present various distributed algorithms for LP-type problems in the well-known gossip model. LP-type problems include many important classes of problems such as (integer) linear programming, geometric problems like smallest enclosing ball and polytope distance, and set problems like hitting set and set cover. In the gossip model, a node can only push information to or pull information from nodes chosen uniformly at random. Protocols for the gossip model are usually very practical due to their fast convergence, their simplicity, and their stability under stress and disruptions. Our algorithms are very efficient (logarithmic rounds or better with just polylogarithmic communication work per node per round) whenever the combinatorial dimension of the given LP-type problem is constant, even if the size of the given LP-type problem is polynomially large in the number of nodes.

Original languageEnglish
Title of host publication33rd International Symposium on Distributed Computing, DISC 2019
EditorsJukka Suomela
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Number of pages16
ISBN (Electronic)9783959771269
DOIs
Publication statusPublished - 1 Oct 2019
Event33rd International Symposium on Distributed Computing, DISC 2019 - Budapest, Hungary
Duration: 14 Oct 201918 Oct 2019

Publication series

NameLeibniz International Proceedings in Informatics (LIPIcs)
Volume146
ISSN (Print)1868-8969

Conference

Conference33rd International Symposium on Distributed Computing, DISC 2019
CountryHungary
CityBudapest
Period14/10/1918/10/19

Keywords

  • Distributed algorithms
  • Gossip algorithms
  • Linear optimization
  • LP-type problems

Fingerprint Dive into the research topics of 'Fast distributed algorithms for Lp-type problems of low dimension'. Together they form a unique fingerprint.

Cite this