Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{zhong:LIPIcs:2020:12949, author = {Xianghui Zhong}, title = {{On the Approximation Ratio of the kOpt and LinKernighan Algorithm for Metric and Graph TSP}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {83:183:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771627}, ISSN = {18688969}, year = {2020}, volume = {173}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12949}, URN = {urn:nbn:de:0030drops129497}, doi = {10.4230/LIPIcs.ESA.2020.83}, annote = {Keywords: traveling salesman problem, metric TSP, graph TSP, kOpt algorithm, LinKernighan algorithm, approximation algorithm, approximation ratio.} }
Keywords:  traveling salesman problem, metric TSP, graph TSP, kOpt algorithm, LinKernighan algorithm, approximation algorithm, approximation ratio.  
Collection:  28th Annual European Symposium on Algorithms (ESA 2020)  
Issue Date:  2020  
Date of publication:  26.08.2020 