Login / Signup
Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms.
Ian Davidson
Michael J. Livanos
Antoine Gourru
Peter B. Walker
Julien Velcin
S. S. Ravi
Published in:
CoRR (2022)
Keyphrases
</>
approximation algorithms
worst case
np hard
np hardness
special case
facility location problem
minimum cost
vertex cover
clustering algorithm
randomized algorithms
primal dual
open shop
network design problem
precedence constraints
computational complexity
set cover
undirected graph
strongly np hard
active learning