DeepAI AI Chat
Log In Sign Up

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

by   Vincent Cohen-Addad, et al.

We consider the k-Median problem on planar graphs: given an edge-weighted planar graph G, a set of clients C ⊆ V(G), a set of facilities F ⊆ 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ϵ^-3 (kϵ^-1))· n^O(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(ϵ^-5 (ϵ^-1))· n^O(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 F_0⊆ F of size k· ( n/ϵ)^O(ϵ^-3) with a guarantee that there is a (1+ϵ)-approximate solution contained in F_0.


page 2

page 3

page 4

page 5

page 7

page 8

page 9

page 14


A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs

We consider the classic Facility Location problem on planar graphs (non-...

A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs

The Capacitated Vehicle Routing problem is to find a minimum-cost set of...

Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs

We consider two optimization problems in planar graphs. In Maximum Weigh...

Bicriteria Approximation Algorithms for Priority Matroid Median

Fairness considerations have motivated new clustering problems and algor...

To Close Is Easier Than To Open: Dual Parameterization To k-Median

The k-Median problem is one of the well-known optimization problems that...

An O(loglog n)-Approximation for Submodular Facility Location

In the Submodular Facility Location problem (SFL) we are given a collect...

Concave connection cost Facility Location and the Star Inventory Routing problem

We study a variant of the uncapacitated facility location problem (UFL),...