Locally searching for large induced matchings

@article{Frst2018LocallySF,
  title={Locally searching for large induced matchings},
  author={Maximilian F{\"u}rst and Marilena Leichter and Dieter Rautenbach},
  journal={Theor. Comput. Sci.},
  year={2018},
  volume={720},
  pages={64-72}
}
  • Maximilian Fürst, Marilena Leichter, Dieter Rautenbach
  • Published in Theor. Comput. Sci. 2018
  • Mathematics, Computer Science
  • It is an easy observation that a natural greedy approach yields a (d−O(1))-factor approximation algorithm for the maximum induced matching problem in d-regular graphs. The only considerable and non-trivial improvement of this approximation ratio was obtained by Gotthilf and Lewenstein using a combination of the greedy approach and local search, where understanding the performance of the local search was the challenging part of the analysis. We study the performance of their local search when… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 12 REFERENCES

    Tighter Approximations for Maximum Induced Matchings in Regular Graphs

    VIEW 5 EXCERPTS
    HIGHLY INFLUENTIAL

    Two greedy consequences for maximum induced matchings

    VIEW 2 EXCERPTS

    On Distance-3 Matchings and Induced Matchings

    VIEW 1 EXCERPT

    On maximum induced matchings in bipartite graphs

    VIEW 1 EXCERPT

    Induced Matchings in Intersection Graphs

    • Kathie Cameron
    • Computer Science, Mathematics
    • Electron. Notes Discret. Math.
    • 2000
    VIEW 1 EXCERPT

    On the approximability of the maximum induced matching problem

    VIEW 3 EXCERPTS

    Induced Matchings in Regular Graphs and Trees

    VIEW 1 EXCERPT