Tighter Approximations for Maximum Induced Matchings in Regular Graphs

Zvi Gotthilf, Moshe Lewenstein. Tighter Approximations for Maximum Induced Matchings in Regular Graphs. In Thomas Erlebach, Giuseppe Persiano, editors, Approximation and Online Algorithms, Third International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Papers. Volume 3879 of Lecture Notes in Computer Science, pages 270-281, Springer, 2005. [doi]

Abstract

Abstract is missing.