DeepAI AI Chat
Log In Sign Up

Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension

by   Kristian Hinnenthal, et al.
Universität Paderborn
TU Eindhoven

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.


Distributed and Streaming Linear Programming in Low Dimensions

We study linear programming and general LP-type problems in several big ...

Property Testing of LP-Type Problems

Given query access to a set of constraints S, we wish to quickly check i...

A Characterization of the Realizable Matoušek Unique Sink Orientations

The Matoušek LP-type problems were used by Matoušek to show that the Sha...

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility

We study the Convex Set Disjointness (CSD) problem, where two players ha...

Simple Combinatorial Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs

We revisit the minimum dominating set problem on graphs with arboricity ...

Secretaries with Advice

The secretary problem is probably the purest model of decision making un...

Pull and Push&Pull in Random Evolving Graphs

The Push, the Pull and the Push&Pull algorithms are well-studied rumor s...