A Breezing Proof of the KMW Bound

by   Corinna Coupette, et al.

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with n nodes and maximum degree Δ on which Ω(min{√(log n/loglog n),logΔ/loglogΔ}) (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching, respectively. Via reduction, this hardness extends to symmetry breaking tasks like finding maximal independent sets or maximal matchings. Today, more than 15 years later, there is still no proof of this result that is easy on the reader. Setting out to change this, in this work, we provide a fully self-contained and simple proof of the KMW lower bound. The key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs.



There are no comments yet.


page 1

page 2

page 3

page 4


Improved Distributed Approximation to Maximum Independent Set

We present improved results for approximating Maximum Independent Set ()...

Distributed Lower Bounds for Ruling Sets

Given a graph G = (V,E), an (α, β)-ruling set is a subset S ⊆ V such tha...

Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees

Recently, Balliu, Brandt, and Olivetti [FOCS '20] showed the first ω(log...

Hardness of Distributed Optimization

This paper studies lower bounds for fundamental optimization problems in...

Parameterized Complexity of Minimum Membership Dominating Set

Given a graph G=(V,E) and an integer k, the Minimum Membership Dominatin...

A Simple Proof of Optimal Approximations

The fundamental result of Li, Long, and Srinivasan on approximations of ...

The Complexity of Symmetry Breaking in Massive Graphs

The goal of this paper is to understand the complexity of symmetry break...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.