Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms.

Sara Ahmadian Ashkan Norouzi-Fard Ola Svensson Justin Ward

Published in: FOCS (2017)

Keyphrases

primal dual
interior point
linear programming
linear program
convex optimization
learning algorithm
computational complexity
interior point methods
simplex algorithm
upper bound
multiscale
worst case
linear programming problems
convex optimization problems