A (3+ε)-FPT approximation for fair sum-of-radii clustering with outliers that extends to any monotone symmetric norm objective and produces a norm-oblivious list of candidate solutions.
Tight running time lower bounds for strong inapproximability of maximum k-coverage, unique set cover and related problems (via t-wise agreement testing theorem)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
FPT Approximations for Fair Sum of Radii with Outliers and General Norm Objectives
A (3+ε)-FPT approximation for fair sum-of-radii clustering with outliers that extends to any monotone symmetric norm objective and produces a norm-oblivious list of candidate solutions.