Approximating Bipartite Minimum Vertex Cover in the CONGEST Model

Salwa Faour, Fabian Kuhn. Approximating Bipartite Minimum Vertex Cover in the CONGEST Model. In Quentin Bramas, Rotem Oshman, Paolo Romano 0002, editors, 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference). Volume 184 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

@inproceedings{FaourK20,
  title = {Approximating Bipartite Minimum Vertex Cover in the CONGEST Model},
  author = {Salwa Faour and Fabian Kuhn},
  year = {2020},
  doi = {10.4230/LIPIcs.OPODIS.2020.29},
  url = {https://doi.org/10.4230/LIPIcs.OPODIS.2020.29},
  researchr = {https://researchr.org/publication/FaourK20},
  cites = {0},
  citedby = {0},
  booktitle = {24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference)},
  editor = {Quentin Bramas and Rotem Oshman and Paolo Romano 0002},
  volume = {184},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-176-4},
}