1 citations · 1 across the 3 of their papers we have counts for
4 papers
FPT Approximation for Fair Minimum-Load Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +2
In this paper, we consider the Minimum-Load -Clustering/Facility Location (MLkC) problem where we are given a set of points in a metric space that we have to cluster and…
Lossy Kernelization of Same-Size Clustering
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach +2
In this work, we study the -median clustering problem with an additional equal-size constraint on the clusters, from the perspective of parameterized preprocessing. Our main res…
Parameterized Complexity of Categorical Clustering with Size Constraints
Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit
In the Categorical Clustering problem, we are given a set of vectors (matrix) A={a_1,\ldots,a_n} over Σ^m, where Σis a finite alphabet, and integers k and B. The task is to partiti…
Metric Dimension Parameterized by Treewidth
Édouard Bonnet, Nidhi Purohit
A resolving set of a graph is a subset of its vertices such that no two vertices of have the same distance vector to . The Metric Dimension problem asks for a resolv…