A Constant-Factor Bi-Criteria Approximation Guarantee for $k$-means++.
Dennis WeiPublished in: CoRR (2016)
Keyphrases
- constant factor
- approximation guarantees
- bicriteria
- k means
- approximation algorithms
- lower bound
- efficient solutions
- knapsack problem
- integer linear programming
- linear programming relaxation
- worst case
- upper bound
- np hard
- flowshop
- shortest path problem
- greedy algorithm
- approximation ratio
- optimal solution
- sample complexity
- special case
- minimum cost
- column generation
- branch and bound
- mathematical model
- shortest path
- scheduling problem