## Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics

- Vincent Cohen-Addad, Philip N. Klein, Claire Mathieu
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

In the Steiner Forest problem, we are given a graph and a collection of source-sink pairs, and the goal is to find a subgraph of minimum total length such that all pairs are connected. The problem is APX-Hard and can be 2-approximated by, e.g., the elegant primal-dual algorithm of Agrawal, Klein, and Ravi from 1995. We give a local-search-based constant… (More)

- Steiner tree problem
- Algorithm
- Search algorithm
- Local optimum
- Local search (optimization)
- APX
- Maxima and minima
- Shortest path problem
- Locality of reference
- Network planning and design
- Optimization problem
- Connected component (graph theory)
- STM32
- Mathematical optimization
- Computer science
- Iterated conditional modes