Go to the corresponding LIPIcs Volume Portal 
Antoniadis, Antonios ; KisfaludiBak, Sándor ; Laekhanukit, Bundit ; Vaz, Daniel
pdfformat: 

@InProceedings{antoniadis_et_al:LIPIcs.SWAT.2022.10, author = {Antoniadis, Antonios and KisfaludiBak, S\'{a}ndor and Laekhanukit, Bundit and Vaz, Daniel}, title = {{On the Approximability of the Traveling Salesman Problem with Line Neighborhoods}}, booktitle = {18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)}, pages = {10:110:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772365}, ISSN = {18688969}, year = {2022}, volume = {227}, editor = {Czumaj, Artur and Xin, Qin}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16170}, URN = {urn:nbn:de:0030drops161706}, doi = {10.4230/LIPIcs.SWAT.2022.10}, annote = {Keywords: Traveling Salesman with neighborhoods, Group Steiner Tree, Geometric approximation algorithms} }
Keywords:  Traveling Salesman with neighborhoods, Group Steiner Tree, Geometric approximation algorithms  
Collection:  18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022)  
Issue Date:  2022  
Date of publication:  22.06.2022 