Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@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:150:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772495}, ISSN = {18688969}, year = {2022}, volume = {245}, editor = {Chakrabarti, Amit and Swamy, Chaitanya}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/17172}, URN = {urn:nbn:de:0030drops171722}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2022.50}, annote = {Keywords: Hardness of approximation, approximability, approximation algorithms, Label Cover, Unique Games Conjecture, Vertex Cover} }
Keywords:  Hardness of approximation, approximability, approximation algorithms, Label Cover, Unique Games Conjecture, Vertex Cover  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022)  
Issue Date:  2022  
Date of publication:  15.09.2022 