The shortest superstring problem is reduced to this problem by considering overlaps betweenpairs of strings.
The shortest superstring problem is reduced to this problem by considering overlaps betweenpairs of strings. A blind method of solving this problem would search through n minus one factorialover 2 possibilities. Dorigo originally tested his ant colony optimization method on this problem,which can also be solved using insertion heuristics and k-opt methods. A greedy algorithm to solvethis problem simply (*) moves to the nearest neighbor with smallest weight. This NP-hard problem is theequivalent of finding a Hamiltonian cycle on a complete weighted graph with minimum weight. For 10points, name this optimization problem which seeks the minimum distance that the namesake figure wouldhave to go to visit every city on a given map exactly once.
The shortest superstring problem is reduced to this problem by considering overlaps betweenpairs of strings.
travelling salesman problem [or TSP]