BibTeX Export for Approximating Bipartite Minimum Vertex Cover in the CONGEST Model

Copy to Clipboard Download

@InProceedings{faour_et_al:LIPIcs.OPODIS.2020.29,
  author =	{Faour, Salwa and Kuhn, Fabian},
  title =	{{Approximating Bipartite Minimum Vertex Cover in the CONGEST Model}},
  booktitle =	{24th International Conference on Principles of Distributed Systems (OPODIS 2020)},
  pages =	{29:1--29:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-176-4},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{184},
  editor =	{Bramas, Quentin and Oshman, Rotem and Romano, Paolo},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.29},
  URN =		{urn:nbn:de:0030-drops-135149},
  doi =		{10.4230/LIPIcs.OPODIS.2020.29},
  annote =	{Keywords: distributed vertex cover, distributed graph algorithms, distributed optimization, bipartite vertex cover}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail