# P-SLOCAL-Completeness of Maximum Independent Set Approximation

## TL;DR

This paper establishes the P-SLOCAL-completeness of approximating the maximum independent set within a polylogarithmic factor, linking it to the complexity of various distributed computing problems.

## Contribution

It proves that maximum independent set approximation is P-SLOCAL-complete, connecting its complexity to a broad class of distributed problems.

## Key findings

- Maximum independent set approximation is P-SLOCAL-complete.
- Efficient algorithms for this problem imply solutions for many distributed problems.
- Links the complexity of maximum independent set to network decompositions.

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