Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension (Brief Announcement)

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.

[1]  Bernhard Haeupler,et al.  Analyzing Network Coding (Gossip) Made Easy , 2010, J. ACM.

[2]  Emo Welzl,et al.  Partition trees for triangle counting and other range searching problems , 1988, SCG '88.

[3]  Emo Welzl,et al.  A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization , 2001, Discret. Comput. Geom..

[4]  Jiangwei Pan,et al.  Near-Linear Algorithms for Geometric Hitting Sets and Set Covers , 2020, Discret. Comput. Geom..

[5]  Christian Scheideler,et al.  Stabilizing consensus with the power of two choices , 2011, SPAA '11.

[6]  Richard M. Karp,et al.  Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[7]  Abhiram G. Ranade,et al.  How to emulate shared memory , 1991, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[8]  Nick Littlestone,et al.  Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm , 2004, Machine Learning.

[9]  Danny Raz,et al.  Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control , 2004, SIAM J. Comput..

[10]  Hsin-Hao Su,et al.  Optimal Gossip Algorithms for Exact and Approximate Quantile Computations , 2018, PODC.

[11]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1995, SIAM J. Comput..

[12]  Moti Medina,et al.  Distributed Set Cover Approximation: Primal-Dual with Optimal Locality , 2018, DISC.

[13]  Martin E. Dyer,et al.  A parallel algorithm for linear programming in fixed dimension , 1995, SCG '95.

[14]  Bernd Gärtner,et al.  Clarkson's Algorithm for Violator Spaces , 2009, CCCG.

[15]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[16]  Noga Alon,et al.  Parallel linear programming in fixed dimension almost surely in constant time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  David Steurer,et al.  Analytical approach to parallel repetition , 2013, STOC.

[18]  Michael T. Goodrich.  Geometric partitioning made easier, even in parallel , 1993, SCG '93.

[19]  Aravind Srinivasan,et al.  Chernoff-Hoeffding bounds for applications with limited independence , 1995, SODA '93.

[20]  Roger Wattenhofer,et al.  The price of being near-sighted , 2006, SODA '06.

[21]  Johannes Gehrke,et al.  Gossip-based computation of aggregate information , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[22]  Mihalis Yannakakis,et al.  Linear programming without the matrix , 1993, STOC.

[23]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[24]  Emo Welzl,et al.  Linear Programming - Randomization and Abstract Frameworks , 1996, STACS.

[25]  Uri Zwick,et al.  An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm , 2015, STOC.

[26]  Jirí Matousek,et al.  Violator spaces: Structure and algorithms , 2008, Discret. Appl. Math..

[27]  Petteri Kaski,et al.  Approximating max-min linear programs with local algorithms , 2007, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[28]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[29]  Roger Wattenhofer,et al.  Local Computation , 2010, J. ACM.

[30]  M. Bálek,et al.  Abstract Models of Optimization Problems , 2007 .

[31]  Martin E. Dyer,et al.  A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..