The Online-TSP against Fair Adversaries

Download PDF
Open Webpage

Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie

Published: 2000, Last Modified: 15 May 2025CIAC 2000EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible.