Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST

27 May 2020 Efron Yuval Grossman Ofer Khoury Seri

By far the most fruitful technique for showing lower bounds for the CONGEST model is reductions to two-party communication complexity. This technique has yielded nearly tight results for various fundamental problems such as distance computations, minimum spanning tree, minimum vertex cover, and more... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • DISTRIBUTED, PARALLEL, AND CLUSTER COMPUTING
  • DATA STRUCTURES AND ALGORITHMS