@InProceedings{stankovic:LIPIcs.APPROX/RANDOM.2022.50,
  author =	{Stankovi\'{c}, Aleksa},
  title =	{{Some Results on Approximability of Minimum Sum Vertex Cover}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)},
  pages =	{50:1--50:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-249-5},
  ISSN =	{1868-8969},
  year =	{2022},
  volume =	{245},
  editor =	{Chakrabarti, Amit and Swamy, Chaitanya},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2022.50},
  URN =		{urn:nbn:de:0030-drops-171722},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2022.50},
  annote =	{Keywords: Hardness of approximation, approximability, approximation algorithms, Label Cover, Unique Games Conjecture, Vertex Cover}
}