The Unreasonable Success of Local Search: Geometric Optimization
Computational Geometry
2015-09-10 v4 Data Structures and Algorithms
Abstract
What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude is an approximation scheme for the following problems in the Euclidian plane: TSP with random inputs, Steiner tree with random inputs, facility location (with worst case inputs), and bicriteria -median (also with worst case inputs). The randomness assumption is necessary for TSP.
Keywords
Cite
@article{arxiv.1410.0553,
title = {The Unreasonable Success of Local Search: Geometric Optimization},
author = {Vincent Cohen-Addad and Claire Mathieu},
journal= {arXiv preprint arXiv:1410.0553},
year = {2015}
}