A tight approximation algorithm for the cluster vertex deletion problem.
Manuel AprileMatthew DrescherSamuel FioriniTony HuynhPublished in: Math. Program. (2023)
Keyphrases
- worst case
- objective function
- cost function
- dynamic programming
- preprocessing
- k means
- np hard
- learning algorithm
- detection algorithm
- error bounds
- hierarchical clustering
- approximation ratio
- significant improvement
- experimental evaluation
- times faster
- ant colony optimization
- optimization algorithm
- recognition algorithm
- clustering algorithm
- theoretical analysis
- high accuracy
- computational complexity
- optimal solution
- segmentation algorithm
- linear programming
- upper bound
- matching algorithm
- probabilistic model
- computational cost
- lower bound
- greedy algorithm
- convergence rate
- randomized algorithm
- polynomial time approximation