A Polynomial-Time Deterministic Approach to the Traveling Salesperson Problem.

Ali Jazayeri Hiroki Sayama

Published in: CoRR (2016)

Keyphrases

deterministic domains
special case
approximation algorithms
turing machine
decomposable negation normal form
worst case
computational complexity
black box
approximation guarantees
np hardness
dynamic programming
multi agent systems
video sequences
finite automata
databases
stochastic methods
information retrieval