BibTeX Export for A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus

Copy to Clipboard Download

@InProceedings{sun:LIPIcs.APPROX/RANDOM.2024.18,
  author =	{Sun, Hao},
  title =	{{A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024)},
  pages =	{18:1--18:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-348-5},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{317},
  editor =	{Kumar, Amit and Ron-Zewi, Noga},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2024.18},
  URN =		{urn:nbn:de:0030-drops-210112},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2024.18},
  annote =	{Keywords: Feedback Vertex Set, Combinatorial Optimization, Approximation Algorithms, min-max relation, linear programming}
}

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