@InProceedings{vanwijland_et_al:LIPIcs.SoCG.2024.81,
  author =	{van Wijland, Ernest and Zhou, Hang},
  title =	{{Faster Approximation Scheme for Euclidean k-TSP}},
  booktitle =	{40th International Symposium on Computational Geometry (SoCG 2024)},
  pages =	{81:1--81:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-316-4},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{293},
  editor =	{Mulzer, Wolfgang and Phillips, Jeff M.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2024.81},
  URN =		{urn:nbn:de:0030-drops-200268},
  doi =		{10.4230/LIPIcs.SoCG.2024.81},
  annote =	{Keywords: approximation algorithms, optimization, traveling salesman problem}
}