Ultimate greedy approximation of independent sets in subcubic graphs

01/31/2020
by   Piotr Krysta, et al.
0

We study the approximability of the maximum size independent set (MIS) problem in bounded degree graphs. This is one of the most classic and widely studied NP-hard optimization problems. We focus on the well known minimum degree greedy algorithm for this problem. This algorithm iteratively chooses a minimum degree vertex in the graph, adds it to the solution and removes its neighbors, until the remaining graph is empty. The approximation ratios of this algorithm have been very widely studied, where it is augmented with an advice that tells the greedy which minimum degree vertex to choose if it is not unique. Our main contribution is a new mathematical theory for the design of such greedy algorithms with efficiently computable advice and for the analysis of their approximation ratios. With this new theory we obtain the ultimate approximation ratio of 5/4 for greedy on graphs with maximum degree 3, which completely solves the open problem from the paper by Halldorsson and Yoshihara (1995). Our algorithm is the fastest currently known algorithm with this approximation ratio on such graphs. We apply our new algorithm to the minimum vertex cover problem on graphs with maximum degree 3 to obtain a substantially faster 6/5-approximation algorithm than the one currently known. We complement our positive, upper bound results with negative, lower bound results which prove that the problem of designing good advice for greedy is computationally hard and even hard to approximate on various classes of graphs. These results significantly improve on such previously known hardness results. Moreover, these results suggest that obtaining the upper bound results on the design and analysis of greedy advice is non-trivial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2018

Maximum Independent Sets in Subcubic Graphs: New Results

The maximum independent set problem is known to be NP-hard in the class ...
research
10/12/2019

Improved (In-)Approximability Bounds for d-Scattered Set

In the d-Scattered Set problem we are asked to select at least k vertice...
research
02/03/2022

On constant-time quantum annealing and guaranteed approximations for graph optimization problems

Quantum Annealing (QA) is a computational framework where a quantum syst...
research
09/30/2020

Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs

Computing the size of maximum independent sets is a NP-hard problem for ...
research
02/06/2023

Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation

Our main result is designing an algorithm that returns a vertex cover of...
research
02/14/2022

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs

We consider the classical Minimum Crossing Number problem: given an n-ve...
research
10/17/2016

How Well Do Local Algorithms Solve Semidefinite Programs?

Several probabilistic models from high-dimensional statistics and machin...

Please sign up or login with your details

Forgot password? Click here to reset