On the complexity of local search

@inproceedings{Papadimitriou1990OnTC,
  title={On the complexity of local search},
  author={C. Papadimitriou and A. Sch{\"a}ffer and M. Yannakakis},
  booktitle={STOC '90},
  year={1990}
}
We prove a number of complexity results on the computational paradigm of local op-timality. Our main results are these: (a) Finding a local optimum under the Lin-Kernighan heuristic for the traveling salesman problemis PLS-complete. (b) Finding stable configurations in neural networks in the Hopfield mode/is PLS-complete. (c) We show that a host of simple unweighted local optimality problems are P-complete. (d) We introduce a general framework for establishing exponential worst-case bounds for… Expand
On the Hardness of Global and Local Approximation
  • H. Klauck
  • Mathematics, Computer Science
  • SWAT
  • 1996
TLDR
The main tool is a special reduction called the “strong PLS-reduction” which preserves cost and local search structure in a very strict sense and allows to deduce that both approximation of global and of local optima cannot be achieved efficiently. Expand
Local Search: Simple, Successful, But Sometimes Sluggish
TLDR
This paper revisits well-known and successful local search heuristics and presents results on the complexity of the frequently used standard local search algorithm for various problems, focusing in on worst case, average case, and smoothed complexity along with the existence of sequences of improving steps of exponential length. Expand
Classification and Approximation of Geometric Location Problems
TLDR
An algorithm approximating the FUZZY k-MEANS problem with a factor of (1 + ) is presented, which improves previously presented algorithms as its runtime is independent of any weight of the input points and the exponential dependence on the number of clusters is linear. Expand
A Model for Analyzing Black-Box Optimization
TLDR
This work is interested in developing a general methodology for predicting the quality of local-neighborhood operators and heuristics, given a time budget and a solution evaluation function. Expand
On the Computational Cost and Complexity of Stochastic Inverse Solvers
TLDR
The goal of this paper is to provide a starting point for investigations into a mainly underdeveloped area of research regarding the computational cost analysis of complex stochastic strategies for solving parametric inverse problems, and to express the problems of finding local and global optima in terms of a classic complexity theory. Expand
An Empirical Study of Greedy Local Search for Satisfiability Testing
TLDR
This paper describes the space traversed by GSAT, and discusses two general, domain-independent extensions that dramatically improve GSAT's performance on structured problems: the use of clause weights, and a way to average in near-solutions when initializing lhe procedure before each try. Expand
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
TLDR
This work presents the first runtime analysis of an ACO algorithm, which transfers many rigorous results on the runtime of a simple evolutionary algorithm to the authors' algorithm and examines the choice of the evaporation factor, a crucial parameter in ACO algorithms, in detail for a toy problem. Expand
The relative complexity of NP search problems
TLDR
This work proves several separations which show that in a generic relativized world, the search classes are distinct and there is a standard search problem in each of them that is not computationally equivalent to any decision problem. Expand
Runtime Analysis of a Simple Ant Colony Optimization Algorithm
TLDR
This work presents the first runtime analysis of an ACO algorithm, which transfers many rigorous results with respect to the runtime of a simple evolutionary algorithm to the authors' algorithm, and examines the choice of the evaporation factor, a crucial parameter in ACO algorithms, in detail. Expand
The Relative Complexity of NP Search Problems
TLDR
This work proves several separations which show that in a generic relativized world the search classes are distinct and there is a standard search problem in each of them that is not computationally equivalent to any decision problem. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 25 REFERENCES
Structure in locally optimal solutions
  • M. Krentel
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
TLDR
It is first shown that CNF (conjunctive normal form) satisfiability is PLS-complete, even with simultaneously bounded size clauses and bounded number of occurrences of variables, and this result is used to show that traveling salesman under the k-opt neighborhood is also P LS-complete. Expand
How easy is local search?
TLDR
A natural class PLS is defined consisting essentially of those local search problems for which local optimality can be verified in polynomial time, and it is shown that there are complete problems for this class. Expand
Simple Local Search Problems That are Hard to Solve
TLDR
It is shown here that several natural, simple local search problems are PLS-complete, and thus just as hard. Expand
Low order polynomial bounds on the expected performance of local improvement algorithms
  • C. Tovey
  • Mathematics, Computer Science
  • Math. Program.
  • 1986
We present a general abstract model of local improvement, applicable to such diverse cases as principal pivoting methods for the linear complementarity problem and hill climbing in artificialExpand
A probabilistic analysis of the switching algorithm for the euclidean TSP
  • W. Kern
  • Mathematics, Computer Science
  • Math. Program.
  • 1989
TLDR
The well-known switching algorithm proposed by Lin and Kernighan for the Euclidean Travelling Salesman Problem is derived theoretically and a bound of O(n18) with probability 1 −c/n is come up with, whereas in practice the algorithm works slightly better. Expand
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a generalExpand
On Finding Locally Optimal Solutions (extended abstract)
TLDR
The problem of finding locally optimal solutions to combinatorial problems in the framework of PLS as defined in [JPY88] is considered and the problem of verifying local optimality can be solved in LOGSPACE. Expand
Combinatorial Optimization: Algorithms and Complexity
This clearly written , mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficientExpand
Experiments on traveling salesman heuristics
This paper describes recent work on finding approximate solutions to large geometric traveling salesman problems. The primary example is the analysis and improvement of the run time of an efficientExpand
On Total Functions, Existence Theorems and Computational Complexity
TLDR
Nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist form an interesting complexity class between P and NP, which is called TFNP and contains a host of important problems, whose membership in P is currently not known. Expand
...
1
2
3
...