AI Chat AI Image Generator AI Video Text to Speech

P-SLOCAL-Completeness of Maximum Independent Set Approximation

07/24/2019

∙

by Yannic Maus, et al.

∙

∙

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 efficient algorithms for many problems in the LOCAL model including the computation of (polylog n, polylog n) network decompositions.

page 1

page 2

page 3

page 4

research

∙ 11/29/2017

The Complexity of Maximum k-Order Bounded Component Set Proble

Given a graph G=(V, E) and a positive integer k, in Maximum k-Order Boun...

0 Sounaka Mishra, et al. ∙

research

∙ 06/27/2020

The Generalized Independent and Dominating Set Problems on Unit Disk Graphs

In this article, we study a generalized version of the maximum independe...

0 Sangram K. Jena, et al. ∙

research

∙ 11/20/2018

Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation

In this paper, we study the problems of principal Generalized Eigenvecto...

0 Kush Bhatia, et al. ∙

research

∙ 01/18/2023

An Improved Approximation for Maximum Weighted k-Set Packing

We consider the weighted k-set packing problem, in which we are given a ...

0 Theophile Thiery, et al. ∙

research

∙ 08/05/2020

An Algorithm Framework for the Exact Solution and Improved Approximation of the Maximum Weighted Independent Set Problem

The Maximum Weighted Independent Set (MWIS) problem, which considers a g...

0 Kai Sun, et al. ∙

research

∙ 03/26/2019

On the tractability of the maximum independent set problem

The maximum independent set problem is a classical NP-complete problem i...

0 R. Dharmarajan, et al. ∙

research

∙ 07/04/2021

Fine-Grained Completeness for Optimization in P

We initiate the study of fine-grained completeness theorems for exact an...

0 Karl Bringmann, et al. ∙