@InProceedings{gong_et_al:LIPIcs.MFCS.2022.53,
author = {Gong, Mingyang and Fan, Jing and Lin, Guohui and Miyano, Eiji},
title = {{Approximation Algorithms for Covering Vertices by Long Paths}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {53:1--53:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.53},
URN = {urn:nbn:de:0030-drops-168517},
doi = {10.4230/LIPIcs.MFCS.2022.53},
annote = {Keywords: Path cover, k-path, local improvement, amortized analysis, approximation algorithm}
}