# Efficient approximation schemes for uniform-cost clustering problems in planar graphs

arXiv: https://arxiv.org/abs/1905.00656 · HTML: https://mlsanity.com/paper/1905.00656/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 May 2019.

## Built on by (most cited first, 2 of 2)

- [Towards Optimal Lower Bounds for k-median and k-means Coresets](https://mlsanity.com/paper/2202.12793/) (2022)
- [Parameterized Approximation Schemes for Clustering with General Norm Objectives](https://mlsanity.com/paper/2304.03146/) (2023)

## Abstract (arXiv)

We consider the k-Median problem on planar graphs: given an edge-weighted planar graph G, a set of clients C subseteq V(G), a set of facilities F subseteq V(G), and an integer parameter k, the task is to find a set of at most k facilities whose opening minimizes the total connection cost of clients, where each client contributes to the cost with the distance to the closest open facility. We give two new approximation schemes for this problem: -- FPT Approximation Scheme: for any ε>0, in time 2^O(kε-3log (kε-1))· nO(1) we can compute a solution that (1) has connection cost at most (1+ε) times the optimum, with high probability. -- Efficient Bicriteria Approximation Scheme: for any ε>0, in time 2^O(ε-5log (ε-1))· nO(1) we can compute a set of at most (1+ε)k facilities (2) whose opening yields connection cost at most (1+ε) times the optimum connection cost for opening at most k facilities, with high probability. As a direct corollary of the second result we obtain an EPTAS for the Uniform Facility Location on planar graphs, with same running time. Our main technical tool is a new construction of a "coreset for facilities" for k-Median in planar graphs: we show that in polynomial time one can compute a subset of facilities F0subseteq F of size k· (log n/ε)^O(ε-3) with a guarantee that there is a (1+ε)-approximate solution contained in F0.