A Subexponential Parameterized Algorithm for Directed Subset Traveling Salesman Problem on Planar Graphs.
Dániel MarxMarcin PilipczukMichal PilipczukPublished in: SIAM J. Comput. (2022)
Keyphrases
- traveling salesman problem
- combinatorial optimization
- cost function
- ant colony optimization
- hamiltonian cycle
- objective function
- computational complexity
- dynamic programming
- convex hull
- minimum spanning tree
- expectation maximization
- em algorithm
- bayesian networks
- search algorithm
- optimal solution
- greedy algorithm
- graph structure
- planar graphs