🏢 Heinrich Heine University Düsseldorf
Approximately Pareto-optimal Solutions for Bi-Objective k-Clustering
·5572 words·27 mins·
loading
·
loading
AI Generated
Machine Learning
Unsupervised Learning
🏢 Heinrich Heine University Düsseldorf
This paper presents novel algorithms for approximating Pareto-optimal solutions to bi-objective k-clustering problems, achieving provable approximation guarantees and demonstrating effectiveness throu…