Optimal Covering Tours with Turn Costs

Esther M. Arkin, Michael A. Bender, Erik D. Demaine +3

We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it swee…