Fast Distributed Algorithms for LP-Type Problems of Low Dimension

Authors Kristian Hinnenthal, Christian Scheideler, Martijn Struijs

Thumbnail PDF


  • Filesize: 0.63 MB
  • 16 pages

Document Identifiers

Author Details

Kristian Hinnenthal
  • Paderborn University, Germany
Christian Scheideler
  • Paderborn University, Germany
Martijn Struijs
  • TU Eindhoven, The Netherlands

Cite AsGet BibTex

Kristian Hinnenthal, Christian Scheideler, and Martijn Struijs. Fast Distributed Algorithms for LP-Type Problems of Low Dimension. In 33rd International Symposium on Distributed Computing (DISC 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 146, pp. 23:1-23:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


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.

Subject Classification

ACM Subject Classification
  • Theory of computation → Distributed algorithms
  • Theory of computation → Mathematical optimization
  • LP-type problems
  • linear optimization
  • distributed algorithms
  • gossip algorithms


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Noga Alon and Nimrod Megiddo. Parallel linear programming in fixed dimension almost surely in constant time. Journal of the ACM, 41(2):422-434, 1994. Google Scholar
  2. Kenneth L. Clarkson. Las Vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM, 42(2):488-499, 1995. Google Scholar
  3. Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, and Christian Scheideler. Stabilizing Consensus with the Power of Two Choices. In Proc. 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 149-158, 2011. Google Scholar
  4. Martin Dyer. A parallel algorithm for linear programming in fixed dimension. In Proc. 11th Symposium on Computational Geometry (SoCG), pages 345-349, 1995. Google Scholar
  5. Martin Dyer, Bernd Gärtner, Nimrod Megiddo, and Emo Welzl. Linear Programming. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, 3rd edition, chapter 49, pages 49:1-49:19. Chapman and Hall/CRC, 2017. Google Scholar
  6. Martin E. Dyer and Alan M. Frieze. A randomized algorithm for fixed-dimensional linear programming. Mathematical Programming, 44(1-3):203-212, 1989. Google Scholar
  7. Bernd Gärtner. A subexponential algorithm for abstract optimization problems. SIAM Journal on Computing, 24(5):1018-1035, 1995. Google Scholar
  8. Bernd Gärtner and Emo Welzl. Linear programming - randomization and abstract frameworks. In Proc. 13th Symposium on Theoretical Aspects of Computer Science (STACS), pages 669-687, 1996. Google Scholar
  9. Bernd Gärtner and Emo Welzl. A simple sampling lemma: Analysis and applications in geometric optimization. Discrete Computational Geometry, 25:569-590, 2001. Google Scholar
  10. Michael T. Goodrich. Geometric partitioning made easier, even in parallel. In Proc. 9th ACM Symposium on Computational Geometry (SoCG), pages 73-82, 1993. Google Scholar
  11. Bernhard Häupler. Analyzing network coding (gossip) made easy. Journal of the ACM, 63(3):26:1-26:22, 2016. Google Scholar
  12. Bernhard Häupler, Jeet Mohapatra, and Hsin-Hao Su. Optimal gossip algorithms for exact and approximate quantile computations. In Proc. ACM Symposium on Principles of Distributed Computing (PODC), pages 179-188, 2018. Google Scholar
  13. Richard M. Karp, Christian Schindelhauer, Scott Shenker, and Berthold Vöcking. Randomized rumor spreading. In Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 565-574, 2000. Google Scholar
  14. David Kempe, Alin Dobra, and Johannes Gehrke. Gossip-Based Computation of Aggregate Information. In Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS 2003), pages 482-491, 2011. Google Scholar
  15. Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. In Proc. 28th IEEE Symposium on Foundations of Computer Science (FOCS), pages 68-77, 1987. Google Scholar
  16. Abhiram G. Ranade. How to emulate shared memory. Journal of Computer and System Sciences, 42(3):307-326, 1991. Google Scholar
  17. Jeanette Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223-250, 1995. Google Scholar
  18. Micha Sharir and Emo Welzl. A combinatorial bound for linear programming and related problems. In Proc. 9th Symposium on Theoretical Aspects of Computer Science (STACS), pages 569-579, 1992. Google Scholar
  19. Petr Škovroň. Abstract Models of Optimization Problems. PhD thesis, Charles University, Prague, 2007. Google Scholar
  20. Emo Welzl. Partition trees for triangle counting and other range searching problems. In Proc. 4th ACM Symposium on Computational Geometry (SoCG), pages 23-33, 1988. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail