Optimal Covering Tours with Turn Costs

What this record says

We give the first algorithmic study of a class of ``covering tour'' problems related to the geometric Traveling Salesman Problem:

CATALOG · The abstract is indexed.