Login / Signup
Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time.
Nicolas Dupin
Frank Nielsen
El-Ghazali Talbi
Published in:
OLA (2020)
Keyphrases
</>
np complete
multi objective
clustering algorithm
machine learning
feature selection
data points
optimization problems
linear programming
clustering method
problems involving
data sets
k means
special case
optimization algorithm