For points forming a 2D Pareto front, discrete and continuous K-center clustering are solvable in near-linear O(KN polylog N) time and O(N) memory via dynamic programming over sorted intervals.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CG 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Planar p-center problems are solvable in polynomial time when clustering a Pareto Front
For points forming a 2D Pareto front, discrete and continuous K-center clustering are solvable in near-linear O(KN polylog N) time and O(N) memory via dynamic programming over sorted intervals.