An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs.
Alantha NewmanPublished in: SIAM J. Discret. Math. (2020)
Keyphrases
- graph structure
- random graphs
- graph based algorithm
- undirected graph
- ant colony optimization
- graph construction
- objective function
- optimal solution
- genetic algorithm
- k means
- np hard
- graph isomorphism
- weighted graph
- minimum spanning tree
- maximum cardinality
- graph clustering
- hamiltonian cycle
- dense subgraphs
- graph representation
- graph partitioning
- spanning tree
- bipartite graph
- search space
- graph theoretic
- graph model
- graph theoretical
- adjacency graph
- graph matching
- hyper graph
- traveling salesman problem
- polynomial time complexity
- spectral decomposition
- simulated annealing
- directed acyclic