Planar p-center problems are solvable in polynomial time when clustering a Pareto Front.

Nicolas Dupin Frank Nielsen El-Ghazali Talbi

Published in: CoRR (2019)

Keyphrases

np complete
k means
neural network
clustering method
high dimensionality
clustering algorithm
special case
unsupervised learning
data mining tasks
feature selection
reinforcement learning
constraint satisfaction problems
self organizing maps
decision problems
hierarchical clustering
problems involving