On the approximability of the maximum induced matching problem
Abstract
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio d 1 for MIM in d-regular graphs, for each d 3. We also prove that MIM is APX-complete in d-regular graphs, for each d 3Similar works
This paper was published in CiteSeerX.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.