Fast distributed algorithms for LP-Type problems of bounded dimension (brief announcement)

Kristian Hinnenthal, Christian Scheideler, Martijn Struijs

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

Abstract

In this brief announcement we summarize our results concerning 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 publicationSPAA 2019 - Proceedings of the 31st ACM Symposium on Parallelism in Algorithms and Architectures
Place of PublicationNew York
PublisherAssociation for Computing Machinery, Inc
Pages393-394
Number of pages2
ISBN (Electronic)978-1-4503-6184-2
DOIs
Publication statusPublished - 17 Jun 2019
Event31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019 - Phoenix, United States
Duration: 22 Jun 201924 Jun 2019

Conference

Conference31st ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2019
CountryUnited States
CityPhoenix
Period22/06/1924/06/19

Keywords

  • Abstract linear programs
  • Abstract optimization problems
  • Distributed algorithms
  • Gossip model
  • LP-type problems
  • abstract linear programs
  • abstract optimization problems
  • distributed algorithms
  • gossip model

Fingerprint Dive into the research topics of 'Fast distributed algorithms for LP-Type problems of bounded dimension (brief announcement)'. Together they form a unique fingerprint.

Cite this