Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)
The malleability of TSP2Opt
We prove that the local search optimization problem TSP2Opt, though not known to be PLS-complete, shares an important infeasibility property with other PLS-complete sets.
Unable to display preview. Download preview PDF.
- [BDG88]J.L. Balcázar, J. Diáz and J. Gabarró. Structural Complexity 1. Springer-Verlag, 1988.Google Scholar
- [Fis]S.T. Fischer. The Solution Sets of Local Search Problems. PhD thesis, University of Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, 1995.Google Scholar
- [GJ79]M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.Google Scholar
- [JPY88]D. Johnson, C. Papadimitriou, and M. Yannakakis. How easy is local search? J. Comput. System Sci., 37:79–100, 1988.Google Scholar
- [K89]M. Krentel. Structure in Locally Optimal Solutions. Proc. 30th Annual IEEE Symposium on Foundations of Computer Science, Research Triangle Park, NC, 1989, pp 216–221.Google Scholar
- [K90]M. Krentel. On Finding and Verifying Locally Optimal Solutions. Siam J. Comput., 19:742–749, August 1990.Google Scholar
- [P90]C.H. Papadimitriou. The complexity of the Lin-Kernighan heuristic for the traveling salesman problem. Proc. 22nd Annual ACM Symposium on Theory of Coomputing, Baltimore, MD, 1990, pp84–94.Google Scholar
- [PSY90]C.H. Papadimitriou, A.A. ShÄffer and M. Yannakakis. On the complexity of local optimality. Proc. 22nd Annual ACM Symposium on Theory of Coomputing, Baltimore, MD, 1990, pp84–94.Google Scholar
© Springer-Verlag 1995