Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
SIAM Journal on Discrete Mathematics
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Simple local search problems that are hard to solve
SIAM Journal on Computing
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
The complexity of the Lin-Kernighan heuristic for the traveling salesman problem
SIAM Journal on Computing
Paroids: a canonical format for combinatorial optimization
Discrete Applied Mathematics
Approximation algorithms for geometric median problems
Information Processing Letters
Paroid search: generic local combinatorial optimization
Discrete Applied Mathematics - Special issue: local optimization
The traveling salesman problem with distances one and two
Mathematics of Operations Research
New local search approximation techniques for maximum generalized satisfiability problems
CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Local search, reducibility and approximability of NP-optimization problems
Information Processing Letters
Integer Linear Programs and Local Search for Max-Cut
SIAM Journal on Computing
Improving local search heuristics for some scheduling problems—I
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles)
Discrete Applied Mathematics - Special volume on computational molecular biology
Improving local search heuristics for some scheduling problems. Part II
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation of k-set cover by semi-local optimization
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The minimum labeling spanning trees
Information Processing Letters
On the quality of local search for the quadratic assignment problem
Discrete Applied Mathematics
On the minimum label spanning tree problem
Information Processing Letters
On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
Approximating discrete collections via local improvements
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Greedy local improvement and weighted set packing approximation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
SIAM Journal on Computing
Analysis of a local search heuristic for facility location problems
Journal of Algorithms
Greedy local improvement and weighted set packing approximation
Journal of Algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms
A local search approximation algorithm for k-means clustering
Proceedings of the eighteenth annual symposium on Computational geometry
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Essays and Surveys in Metaheuristics
Essays and Surveys in Metaheuristics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
Algorithmics for Hard Problems
Algorithmics for Hard Problems
A note on the minimum label spanning tree
Information Processing Letters
On Local Search and Placement of Meters in Networks
SIAM Journal on Computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Performance Guarantees of Local Search for Multiprocessor Scheduling
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximations of Independent Sets in Bounded-Degree Graphs
SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The Analysis of Local Search Problems and Their Heuristics
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
A New Algorithm for Energy Minimization with Discontinuities
EMMCVPR '99 Proceedings of the Second International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Non-oblivious Local Search for MAX 2-CCSP with Application to MAX DICUT
WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Positive Linear Programming, Parallel Approximation and PCP's
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
On Local Search for Weighted k-Set Packing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A survey of very large-scale neighborhood search techniques
Discrete Applied Mathematics
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
Metaheuristics in combinatorial optimization: Overview and conceptual comparison
ACM Computing Surveys (CSUR)
Worst-case study of local search for MAX-k-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
Theoretical Computer Science
Approximate local search in combinatorial optimization
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs and Hypergraphs
Multicriteria Optimization
Structure in locally optimal solutions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On syntactic versus computational views of approximability
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Linear time local improvements for weighted matchings in graphs
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
Local search for the minimum label spanning tree problem with bounded color classes
Operations Research Letters
On local search for the generalized graph coloring problem
Operations Research Letters
Local approximations for maximum partial subgraph problem
Operations Research Letters
On the complexity of local search for weighted standard set problems
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Smoothed performance guarantees for local search
ESA'11 Proceedings of the 19th European conference on Algorithms
On the PLS-complexity of maximum constraint assignment
Theoretical Computer Science
| Hi-index | 0.00 |
In this chapter we review the main results known on local search algorithms with worst case guarantees. We consider classical combinatorial optimization problems: satisfiability problems, traveling salesman and quadratic assignment problems, set packing and set covering problems, maximum independent set, maximum cut, several facility location related problems and finally several scheduling problems. A replica placement problem in a distributed file systems is also considered as an example of the use of a local search algorithm in a distributed environment. For each problem we have provided the neighborhoods used along with approximation results. Proofs when too technical are omitted, but often sketch of proofs are provided.