@InProceedings{lin:LIPIcs.ICALP.2019.81,
  author =	{Lin, Bingkai},
  title =	{{A Simple Gap-Producing Reduction for the Parameterized Set Cover Problem}},
  booktitle =	{46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
  pages =	{81:1--81:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-109-2},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{132},
  editor =	{Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.81},
  URN =		{urn:nbn:de:0030-drops-106573},
  doi =		{10.4230/LIPIcs.ICALP.2019.81},
  annote =	{Keywords: set cover, FPT inapproximability, gap-producing reduction, (n, k)-universal set}
}