P-SLOCAL-Completeness of Maximum Independent Set Approximation
Data Structures and Algorithms
2019-12-24 v3 Distributed, Parallel, and Cluster Computing
Abstract
We prove that the maximum independent set approximation problem with polylogarithmic approximation factor is P-SLOCAL-complete. Thus an efficient algorithm for the maximum independent set approximation in the LOCAL model implies efficient algorithms for many problems in the LOCAL model including the computation of (polylog n, polylog n) network decompositions.
Cite
@article{arxiv.1907.10499,
title = {P-SLOCAL-Completeness of Maximum Independent Set Approximation},
author = {Yannic Maus},
journal= {arXiv preprint arXiv:1907.10499},
year = {2019}
}
Comments
added author's name. Please note the breakthrough: arXiv:1907.10937