@InProceedings{zhong:LIPIcs.ESA.2020.83,
author = {Zhong, Xianghui},
title = {{On the Approximation Ratio of the k-Opt and Lin-Kernighan Algorithm for Metric and Graph TSP}},
booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)},
pages = {83:1--83:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-162-7},
ISSN = {1868-8969},
year = {2020},
volume = {173},
editor = {Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2020.83},
URN = {urn:nbn:de:0030-drops-129497},
doi = {10.4230/LIPIcs.ESA.2020.83},
annote = {Keywords: traveling salesman problem, metric TSP, graph TSP, k-Opt algorithm, Lin-Kernighan algorithm, approximation algorithm, approximation ratio.}
}