Skip to content

Opening book details…

Can I read A Breezing Proof of the KMW Bound on EtoBox?

A Breezing Proof of the KMW Bound by Corinna Coupette; Christoph Lenzen is a book available to read on EtoBox.

What is A Breezing Proof of the KMW Bound about?

In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LO-CAL model: For any (randomized) algorithm, there are graphs with n nodes and maximum degree ∆ on which Ω(min{ log n/ log log n, log ∆/ log log ∆}) (expected) communication rounds are required to obtain polylogarithmic approximations to a minimum vertex cover, minimum dominating set, or maximum matching. 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 simplified proof of the main step in showing the KMW lower bound. Our key argument is algorithmic, and it relies on an invariant that can be readily verified from the generation rules of the lower bound graphs.

Author
Corinna Coupette; Christoph Lenzen
Publisher
Society for Industrial and Applied Mathematics
Published
2021
Language
EN

More by Corinna Coupette; Christoph Lenzen

Browse all works by Corinna Coupette; Christoph Lenzen

Similar books