Krysta, PJ, Mari, Mathieu and Zhi, Nan
(2020)
Ultimate greedy approximation of independent sets in subcubic graphs.
In: 31st ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), 2020-1-5 - 2020-1-8, Salt Lake City, UT, USA.
|
Text
proceedings-2-ELEMENTS.pdf - Author Accepted Manuscript Download (1MB) | Preview |
Abstract
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. It is known for its inherent hardness of approximation. 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 Halldórsson and Yoshihara (1995). Our algorithm is the fastest currently known algorithm with this approximation ratio on such graphs. We also obtain a simple and short proof of the (D+2)/3-approximation ratio of any greedy on graphs with maximum degree D, the result proved previously by Halldórsson and Radhakrishnan (1994). We almost match this ratio by showing a lower bound of (D+1)/3 on the ratio of any greedy algorithm that can use any advice. 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.
| Item Type: | Conference or Workshop Item (Unspecified) |
|---|---|
| Depositing User: | Symplectic Admin |
| Date Deposited: | 28 Oct 2019 09:06 |
| Last Modified: | 19 Jan 2023 00:21 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3059656 |
Share
Share
