Towards optimal lower bounds for k-median and k-means coresets
The (k, z)-clustering problem consists of finding a set of k points called centers, such that the
sum of distances raised to the power of z of every data point to its closest center is …
sum of distances raised to the power of z of every data point to its closest center is …
A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs
We give an algorithmic and lower bound framework that facilitates the construction of
subexponential algorithms and matching conditional complexity bounds. It can be applied to …
subexponential algorithms and matching conditional complexity bounds. It can be applied to …
On the fixed-parameter tractability of capacitated clustering
V Cohen-Addad, J Li - ar** and its variants
Abstract In the Token Swap** problem we are given a graph with a token placed on each
vertex. Each token has exactly one destination vertex, and we try to move all the tokens to …
vertex. Each token has exactly one destination vertex, and we try to move all the tokens to …
Subexponential Parameterized Algorithms on Disk Graphs (Extended Abstract)∗
One of the most celebrated results in Parameterized Complexity is the Bidimensionality
theory of Demaine et al.[J. ACM, 2005], which has yielded, over the past two decades …
theory of Demaine et al.[J. ACM, 2005], which has yielded, over the past two decades …
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Time
We present an explicit and efficient construction of additively weighted Voronoi diagrams on
planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant …
planar graphs. Let G be a planar graph with n vertices and b sites that lie on a constant …
Low treewidth embeddings of planar and minor-free metrics
Cohen-Addad, Filtser, Klein and Le FOCS'20 constructed a stochastic embedding of minor-
free graphs of diameter D into graphs of treewidth O_ϵ(\logn) with expected additive …
free graphs of diameter D into graphs of treewidth O_ϵ(\logn) with expected additive …