Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation.

Sándor P. Fekete Dominik Krupke

Published in: CIAC (2019)

Keyphrases

approximation algorithms
traveling salesman problem
computational complexity
worst case
phase transition
approximation error
databases
error bounds
total cost
reinforcement learning
np hard
np complete
production cost