Minimal TSP Tour is coNP-Complete.

Marzio De Biasi

Published in: CoRR (2014)

Keyphrases

traveling salesman problem
conp complete
np complete
combinatorial optimization
ant colony optimization
data exchange
optimization problems
travelling salesman
traveling salesman
conjunctive queries
data complexity
graph isomorphism
decision problems
complexity theoretic
database
np hard
state space