This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
6.3 Bibliographical Notes
Brucker, P., J. Hurink, and F. Werner [1997], Improving local search heuristics for some scheduling problems, Discrete Applied Mathematics 72, 47–69.
Chandra, B., H. Karloff, and C. Tovey [1999], New results on the old k-opt algorithm for the traveling salesman problem, SIAM Journal on Computing 28, 1998–2029.
Fischer, S.T. [1995], A note on the complexity of local search problems, Information Processing Letters 53, 69–75.
Garey, M.R., and D.S. Johnson [1979], Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Company.
Haken, A. [1989], Connectionist networks that need exponential time to stabilize, unpublished manuscript, Department of Computer Science, University of Toronto, Toronto, Canada.
Hurkens, C.A.J., and T. Vredeveld [2003], Local search for multiprocessor scheduling: How many moves does it take to a local optimum?, Operations Research Letters 31, 137–141.
Johnson, D.S., C.H. Papadimitriou, and M. Yannakakis [1988], How easy is local search?, Journal of Computer and System Sciences 37, 79–100.
Luecker, G. [1976], unpublished manuscript, Department of Computer Science, Princeton University, Princeton, NJ.
Papadimitriou, C.H., and K. Steiglitz [1982], Combinatorial Optimization, Prentice-Hall.
Punnen, A.P., M. Margot, and S.N. Kabadi [2003], TSP heuristics: Domination analysis and complexity, Algorithmica 35, 111–127.
Papadimitriou, C.H., A.A. Schäffer, and M. Yannakakis [1990], On the complexity of local search, Proceedings of the 22nd ACM Symposium on Theory of Computing, Baltimore, MD, 438–445.
Schäffer, A.A., and M. Yannakakis [1991], Simple local search problems that are hard to solve, SIAM Journal on Computing 20, 56–87.
Tovey, C. [1997], Local improvement on discrete structures, in: E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, 57–89.
Leeuwen, J. van, and A.A. Schoone [1981], Untangling a traveling salesman tour in the plan, Proceedings of the 7th Conference on Graph Theoretic Concepts in Computer Science, München, Germany, 87–98.
Vredeveld, T. [2002], Combinatorial Approximation Algorithms: Guaranteed Versus Experimental Performance, Ph.D. thesis, Eindhoven University of Technology, The Netherlands.
Yannakakis, M. [1997], Computational complexity, in: E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, 19–55.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Time Complexity. In: Theoretical Aspects of Local Search. Monographs in Theoretical Computer Science, An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-35854-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-35854-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35853-4
Online ISBN: 978-3-540-35854-1
eBook Packages: Computer ScienceComputer Science (R0)