New Results in Sona Drawing: Hardness and TSP Separation.
Man-Kwun ChiuErik D. DemaineYevhenii DiomidovDavid EppsteinRobert A. HearnAdam HesterbergMatias KormanIrene ParadaMikhail RudoyPublished in: CCCG (2020)
Keyphrases
- traveling salesman problem
- np hard
- phase transition
- travelling salesman
- combinatorial optimization
- genetic algorithm
- optimal solution
- computational complexity
- ant colony optimization
- search space
- optimization problems
- learning theory
- real world
- blind separation
- hand drawn
- np hardness
- cost function
- information retrieval
- real time
- software suite