Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time

Nicolas Dupin,Frank Nielsen,El-Ghazali Talbi

doi:10.1007/978-3-030-41913-4_15

Clustering a 2d Pareto Front: P-center Problems Are Solvable in Polynomial Time

Nicolas Dupin, Frank Nielsen + Show 1 more

https://doi.org/10.1007/978-3-030-41913-4_15

Copy DOI

Publication Date: Jan 1, 2020

Citations: 6

Affiliation: University of Paris-Saclay, Institut Polytechnique de Paris, Laboratoire de Recherche en Informatique, Sony Computer Science Laboratories, University of Lille

#P-center Problems #Bi-objective Optimization Problems + Show 8 more

Abstract
Full-Text
Similar Papers

Abstract

Having many non dominated solutions in bi-objective optimization problems, this paper aims to cluster the Pareto front using Euclidean distances. The p-center problems, both in the discrete and continuous versions, become solvable with a dynamic programming algorithm. Having N points, the complexity of clustering is \(O(KN\log N)\) (resp. \(O(KN\log ^2 N)\)) time and O(N) memory space for the continuous (resp. discrete) K-center problem for \(K\geqslant 3\), and in \(O(N\log N)\) time for such 2-center problems. Furthermore, parallel implementations allow quasi-linear speed-up for the practical applications.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.