New Results in Sona Drawing: Hardness and TSP Separation.
Man-Kwun ChiuErik D. DemaineYevhenii DiomidovDavid EppsteinRobert A. HearnAdam HesterbergMatias KormanIrene ParadaMikhail RudoyPublished in: CoRR (2020)
Keyphrases
- traveling salesman problem
- np hard
- travelling salesman
- genetic algorithm
- worst case
- information theoretic
- combinatorial optimization
- engineering drawings
- computational complexity
- ant colony optimization
- software suite
- search space
- optimization problems
- learning theory
- data mining
- np hardness
- np complete
- integer programming
- special case
- sketch recognition
- data structure
- objective function
- neural network