A polynomial-time deterministic approach to the travelling salesperson problem.
Ali JazayeriHiroki SayamaPublished in: Int. J. Parallel Emergent Distributed Syst. (2020)
Keyphrases
- deterministic domains
- special case
- decomposable negation normal form
- randomized algorithm
- approximation algorithms
- computational complexity
- randomized algorithms
- worst case
- neural network
- turing machine
- np hardness
- real time
- routing problem
- finite automata
- constraint satisfaction problems
- social networks
- image sequences
- search space
- stochastic methods
- polynomial time complexity
- machine learning
- deterministic automata
- objective function