  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.
