A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++.
Dennis WeiPublished in: NIPS (2016)
Keyphrases
- approximation guarantees
- constant factor
- bicriteria
- k means
- approximation algorithms
- efficient solutions
- lower bound
- knapsack problem
- integer linear programming
- upper bound
- linear programming relaxation
- worst case
- greedy algorithm
- np hard
- flowshop
- sample complexity
- shortest path problem
- objective function
- special case
- approximation ratio
- minimum cost
- computational complexity
- optimal solution
- bayesian networks