A note on the complexity of local search problems

Authors:
S. T. Fischer
Affiliations:
-
Venue:
Information Processing Letters
Year:
1995

Citing 6
Cited 0

How easy is local search?

Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
On the complexity of local search

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On finding and verifying locally optimal solutions

SIAM Journal on Computing
Simple local search problems that are hard to solve

SIAM Journal on Computing
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we study the complexity of the question whether there exist locally optimal solutions near a given feasible solution. We show that for some problems in PLS, this question is NP-complete. On the other hand, there are also PLS-complete problems for which this question is in P.