Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875560 | Theoretical Computer Science | 2018 | 9 Pages |
Abstract
It is an easy observation that a natural greedy approach yields a (dâO(1))-factor approximation algorithm for the maximum induced matching problem in d-regular graphs. The only considerable and non-trivial improvement of this approximation ratio was obtained by Gotthilf and Lewenstein using a combination of the greedy approach and local search, where understanding the performance of the local search was the challenging part of the analysis. We study the performance of their local search when applied to general graphs, C4-free graphs, {C3,C4}-free graphs, C5-free graphs, and claw-free graphs. As immediate consequences, we obtain approximation algorithms for the maximum induced matching problem restricted to the d-regular graphs in these classes.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Maximilian Fürst, Marilena Leichter, Dieter Rautenbach,