Proves coNP-completeness of verifying mPJR in metric clustering, defines mPJR+ with polynomial-time find-and-check algorithms, and introduces DC-mPJR+ with O(mn log n + mnk) verification that approximates mPJR+.
year = 2020, month = jan
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Check, Please: Verifiably Fair Clustering
Proves coNP-completeness of verifying mPJR in metric clustering, defines mPJR+ with polynomial-time find-and-check algorithms, and introduces DC-mPJR+ with O(mn log n + mnk) verification that approximates mPJR+.