The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Neighborhood search algorithms for finding optimal traveling salesman tours must be inefficient
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
P-complete problems and approximate solutions
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Approximate algorithms for the traveling salesperson problem
SWAT '74 Proceedings of the 15th Annual Symposium on Switching and Automata Theory (swat 1974)
Journal of Computer and System Sciences
`` Strong '' NP-Completeness Results: Motivation, Examples, and Implications
Journal of the ACM (JACM)
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
Evolving combinatorial problem instances that are difficult to solve
Evolutionary Computation
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Toward boosting distributed association rule mining by data de-clustering
Information Sciences: an International Journal
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
A 5/4-approximation algorithm for biconnecting a graph with a given hamiltonian path
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |
It is shown that, unless P&equil;NP, local search algorithms for the Traveling Salesman Problem having polynomial time complexity per iteration will generate solutions arbitrarily far from the optimal. The Traveling Salesman Problem is also shown to be NP-Complete even if its instances are restricted to be realizable by a set of points on the Euclidean plane.