Diversity-aware clustering: Computational Complexity and Approximation Algorithms.
Suhas ThejaswiAmeet GadekarBruno OrdozgoitiAristides GionisPublished in: CoRR (2024)
Keyphrases
- approximation algorithms
- np hard
- special case
- computational complexity
- worst case
- clustering algorithm
- network design problem
- vertex cover
- minimum cost
- k means
- facility location problem
- approximation ratio
- constant factor
- primal dual
- set cover
- np complete
- randomized algorithms
- information theoretic
- integer programming
- data points
- open shop
- np hardness
- optimal solution
- precedence constraints
- combinatorial auctions
- scheduling problem
- polynomial time approximation
- strongly np hard
- approximation schemes
- evolutionary algorithm
- lower bound