With a noisy oracle that says which of three points splits off first, hierarchical clustering achieves constant approximation for Dasgupta and near-optimal Moseley-Wang, bypassing known hardness.
Chen, and Piotr Indyk
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Learning-Augmented Hierarchical Clustering
With a noisy oracle that says which of three points splits off first, hierarchical clustering achieves constant approximation for Dasgupta and near-optimal Moseley-Wang, bypassing known hardness.