Local search: simple, successful, but sometimes sluggish

Authors:
Burkhard Monien;Dominic Dumrauf;Tobias Tscheuschner
Affiliations:
Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany;Faculty of Computer Science, Electrical Engineering and Mathematics, University of Paderborn, Paderborn, Germany
Venue:
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Year:
2010

Citing 43
Cited 4

A new polynomial-time algorithm for linear programming

Combinatorica
The d-step conjecture and its relatives

Mathematics of Operations Research
A simplex variant solving an m×d linear program in O(min(m2,d2)) expected number of pivot steps

Journal of Complexity
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
On the complexity of the parity argument and other inefficient proofs of existence

Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Integer Linear Programs and Local Search for Max-Cut

SIAM Journal on Computing
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem

SIAM Journal on Computing
Data clustering: a review

ACM Computing Surveys (CSUR)
Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
On the Hardness of Global and Local Approximation

SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Analysis of Local Search Problems and Their Heuristics

STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
Solving Real-World Linear Programs: A Decade and More of Progress

Operations Research
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Approximate local search in combinatorial optimization

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time

Journal of the ACM (JACM)
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Symposium of Theory of Computing 2004
The complexity of pure Nash equilibria

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Computing Nash equilibria for scheduling on restricted parallel links

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The Complexity of Boolean Constraint Satisfaction Local Search Problems

Annals of Mathematics and Artificial Intelligence
Sink Equilibria and Convergence

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)

Theoretical Aspects of Local Search (Monographs in Theoretical Computer Science. An EATCS Series)
Inapproximability of pure nash equilibria

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Structure in locally optimal solutions

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the impact of combinatorial structure on congestion games

Journal of the ACM (JACM)
Symmetries and the complexity of pure Nash equilibrium

Journal of Computer and System Sciences
Settling the complexity of computing two-player Nash equilibria

Journal of the ACM (JACM)
k-means requires exponentially many iterations even in the plane

Proceedings of the twenty-fifth annual symposium on Computational geometry
The Complexity of Computing a Nash Equilibrium

SIAM Journal on Computing
Nashification and the coordination ratio for a selfish routing game

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the complexity of pure Nash equilibria in player-specific network congestion games

WINE'07 Proceedings of the 3rd international conference on Internet and network economics
The equilibrium existence problem in finite network congestion games

WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Routing (un-) splittable flow in games with player-specific linear latency functions

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
On the power of nodes of degree four in the local max-cut problem

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Survey: Equilibria, fixed points, and complexity classes

Computer Science Review
On complexity of unconstrained hyperbolic 0-1 programming problems

Operations Research Letters
On local search for the generalized graph coloring problem

Operations Research Letters
Congestion games with player-specific constants

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Computing stable outcomes in hedonic games

SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Settling the complexity of local max-cut (almost) completely

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing stable outcomes in hedonic games with voting-based deviations

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
On the PLS-complexity of maximum constraint assignment

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we survey the research on the complexity of computing locally optimal solutions. We revisit well-known and successful local search heuristics and present results on the complexity of the frequently used standard local search algorithm for various problems. Here, our focus in on worst case, average case, and smoothed complexity along with the existence of sequences of improving steps of exponential length. For a more theoretical investigation, we revisit the framework of PLS and mostly concentrate on the research on CongestionGames, which sparked the interconnection between local search and game theory. We conclude by stating various open problems.