A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem.
Manuel AprileMatthew DrescherSamuel FioriniTony HuynhPublished in: IPCO (2021)
Keyphrases
- preprocessing
- worst case
- detection algorithm
- computational complexity
- k means
- optimization algorithm
- expectation maximization
- dynamic programming
- experimental evaluation
- similarity measure
- hierarchical clustering
- data clustering
- probabilistic model
- learning algorithm
- computational cost
- particle swarm optimization
- cost function
- objective function
- simulated annealing
- np hard
- input data
- optimal solution
- closed form
- times faster
- subspace clustering
- approximation ratio