On the approximability of the maximum induced matching problem

Duckworth, W., Manlove, D.F. and Zito, M. (2005) On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms, 3(1), pp. 79-91. (doi: 10.1016/j.jda.2004.05.001)

Abstract

In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d</i>≥3. We also prove that MIM is APX-complete in <i>d</i>-regular graphs, for each <i>d</i>≥3.

• Item Type: Articles
• Additional Information: Postprint provided by the author
• Keywords: induced matching; strong matching; regular graph; approximation algorithm; APX-completeness
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Manlove, Professor David
• Authors: Duckworth, W., Manlove, D.F., and Zito, M.
• Subjects: Q Science > QA Mathematics
• College/School: College of Science and Engineering > School of Computing Science
• Research Group: Formal Analysis, Theory and Algorithms
• Journal Name: Journal of Discrete Algorithms
• Publisher: Elsevier
• ISSN: 1570-8667
• Copyright Holders: ©2004 Elsevier B.V.
• First Published: First published in Journal of Discrete Algorithms 3(1):79-91
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher.

Related URLs

• Other