@InProceedings{kashaev_et_al:LIPIcs.APPROX/RANDOM.2023.20,
author = {Kashaev, Danish and Sch\"{a}fer, Guido},
title = {{Round and Bipartize for Vertex Cover Approximation}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
pages = {20:1--20:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-296-9},
ISSN = {1868-8969},
year = {2023},
volume = {275},
editor = {Megow, Nicole and Smith, Adam},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.20},
URN = {urn:nbn:de:0030-drops-188459},
doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.20},
annote = {Keywords: Combinatorial optimization, approximation algorithms, rounding algorithms, beyond the worst-case analysis}
}