Approximability results for the maximum and minimum maximal induced matching problems

An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-vertices induce a 1-regular subgraph. An induced matching M is maximal if no other induced matching contains M. The MINIMUM MAXIMAL INDUCED MATCHING problem asks for a minimum maximal induced matching in a given graph. The problem is known to be NP-complete. Here we show that, if P 6= NP, for any " > 0, this problem cannot be approximated within a factor of n1−" in polynomial time, where n denotes the number of vertices in the input graph. The result holds even if the graph in question is restricted to being bipartite. For the related problem of finding an induced matching of maximum size (MAXIMUM INDUCED MATCHING), it is shown that, if P 6= NP, for any " > 0, the problem cannot be approximated within a factor of n1/2−" in polynomial time. Moreover, we show that MAXIMUM INDUCED MATCHING is NP-complete for planar line graphs of planar bipartite graphs