A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

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

Résumé

We consider the classic FACILITY LOCATION problem on planar graphs (non-uniform, uncapacitated). Given an edge-weighted planar graph G, a set of clients C ⊆ V (G), a set of facilities F ⊆ V (G), and opening costs open : F → R 0 , the goal is to find a subset D of F that minimizes c∈C min f ∈D dist(c, f) + f ∈D open(f). The FACILITY LOCATION problem remains one of the most classic and fundamental optimization problem for which it is not known whether it admits a polynomial-time approximation scheme (PTAS) on planar graphs despite significant effort for obtaining one. We solve this open problem by giving an algorithm that for any ε > 0, computes a solution of cost at most (1 + ε) times the optimum in time n 2 O(ε −2 log(1/ε)) .
Fichier principal
Vignette du fichier
main-nufl.pdf (732.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02360765 , version 1 (13-11-2019)

Identifiants

Citer

Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk. A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs. FOCS'19, Nov 2019, Baltimore, United States. ⟨hal-02360765⟩
84 Consultations
42 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More