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+.
Trends in computational social choice , volume=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
No citing papers match the current filters.