A Approximation Algorithm for the Minimum Maximal Matching Problem

Zvi Gotthilf, Moshe Lewenstein, Elad Rainshmidt. A Approximation Algorithm for the Minimum Maximal Matching Problem. In Evripidis Bampis, Martin Skutella, editors, Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers. Volume 5426 of Lecture Notes in Computer Science, pages 267-278, Springer, 2008. [doi]

@inproceedings{GotthilfLR08,
  title = {A Approximation Algorithm for the Minimum Maximal Matching Problem},
  author = {Zvi Gotthilf and Moshe Lewenstein and Elad Rainshmidt},
  year = {2008},
  doi = {10.1007/978-3-540-93980-1_21},
  url = {http://dx.doi.org/10.1007/978-3-540-93980-1_21},
  researchr = {https://researchr.org/publication/GotthilfLR08},
  cites = {0},
  citedby = {0},
  pages = {267-278},
  booktitle = {Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers},
  editor = {Evripidis Bampis and Martin Skutella},
  volume = {5426},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-93979-5},
}