Covering Tours with Turn Cost: 03 Variants, Approximation ...

in the plane with minimal turn cost was considered by Aggarwal et al. [1], who provide a O(logn) ap-proximation algorithm, but also show that already the cycle cover version is NP-hard. Arkin et al. [3] consider di erent grid-based versions of covering with turn cost, and provide a spectrum of approximation algorithms. ................
................