16 citations · 30 across the 6 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019★ 3 cited
Efficient approximation schemes for uniform-cost clustering problems in planar graphs
Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
We consider the -Median problem on planar graphs: given an edge-weighted planar graph , a set of clients , a set of facilities , and an in…
cs.DS2019★ 6 cited
A Polynomial-Time Approximation Scheme for Facility Location on Planar Graphs
Vincent Cohen-Addad, Marcin Pilipczuk, Michał Pilipczuk
We consider the classic Facility Location problem on planar graphs (non-uniform, uncapacitated). Given an edge-weighted planar graph , a set of clients , a set…