Tighter approximations for maximum induced matchings in regular graphs

Zvi Gotthilf, Moshe Lewenstein

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

An induced matching is a matching in which each two edges of the matching are not connected by a joint edge. Induced matchings are well-studied combinatorial objects and a lot of consideration has been given to finding maximum induced matchings, which is an NP-complete problem. Specifically, finding maximum induced matchings in regular graphs is well-known to be NP-complete. A couple of papers lately showed a couple of simple greedy algorithm that approximate a maximum induced matching with a factor of d - 1/2 and d - 1 (different papers - different factors), where d is the degree of regularity. We show here a simple algorithm with an 0.75d + 0.15 approximation factor. The algorithm is simple - the analysis is not.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - Third International Workshop, WAOA 2005, Revised Selected Papers
Pages270-281
Number of pages12
DOIs
StatePublished - 2006
Event3rd International Workshop on Approximation and Online Algorithms, WAOA 2005 - Palma de Mallorca, Spain
Duration: 6 Oct 20057 Oct 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3879 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Workshop on Approximation and Online Algorithms, WAOA 2005
Country/TerritorySpain
CityPalma de Mallorca
Period6/10/057/10/05

Fingerprint

Dive into the research topics of 'Tighter approximations for maximum induced matchings in regular graphs'. Together they form a unique fingerprint.

Cite this