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

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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2020-05
Hauptverfasser:	Efron, Yuval, Grossman, Ofer, Khoury, Seri
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Communication Complexity Graph theory Hardness Lower bounds Mathematical analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!