An Exemplars-Based Approach for Explainable Clustering: Complexity and Efficient Approximation Algorithms.
Ian DavidsonMichael J. LivanosAntoine GourruPeter B. WalkerJulien VelcinS. S. RaviPublished in: SDM (2024)
Keyphrases
- approximation algorithms
- worst case
- np hard
- special case
- np hardness
- vertex cover
- facility location problem
- approximation ratio
- randomized algorithms
- primal dual
- minimum cost
- approximation schemes
- network design problem
- greedy algorithm
- constant factor approximation
- open shop
- clustering algorithm
- set cover
- exact algorithms
- computational complexity
- similarity function
- disjoint paths