This work gives a separator-based recursive approximation algorithm for the continuous-center setting of the group-fair Euclidean problem in fixed dimension, where the input points are partitioned into disjoint color classes, and every cluster must satisfy given lower and upper bounds on the fraction of each color.
We study the classical and parameterized complexity of efficient connected allocation problems on graphs, where efficiency is measured by egalitarian and utilitarian welfare maximization. We first establish a sharp complexity dichotomy in the classical setting: both problems are NP-hard in general and remain hard even...
S. Bandopadhyay, Anish Datta, Palash Dey et al.· 0 citations
A faster approximation algorithms that produce valid schedules for telephone broadcasting, and parameterized hardness for vertex cover above maximum matching, dominating set size, and graph diameter, indicating that FPT algorithms for these parameters are unlikely.
Rudranarayan Kar, Praneet Kumar Patra, Diya Roy et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
