6 citations · 10 across the 3 of their papers we have counts for
3 papers
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…
cs.DS2018★ 1 cited
Lower bounds for text indexing with mismatches and differences
Vincent Cohen-Addad, Laurent Feuilloley, Tatiana Starikovskaya
In this paper we study lower bounds for the fundamental problem of text indexing with mismatches and differences. In this problem we are given a long string of length , the "tex…