Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.
Zachary FriggstadKamyar KhodamoradiMohammad R. SalavatipourPublished in: SODA (2019)
Keyphrases
- exact algorithms
- benchmark instances
- lower bound
- exact methods
- max sat
- k means
- exact solution
- knapsack problem
- linear programming relaxation
- upper bound
- lower and upper bounds
- approximation algorithms
- quadratic assignment problem
- combinatorial optimization
- np hard
- branch and bound algorithm
- vehicle routing problem with time windows
- benders decomposition
- branch and bound
- heuristic methods
- clustering algorithm
- worst case
- combinatorial optimization problems
- combinatorial problems
- euclidean distance
- optimal solution
- objective function
- randomly generated
- euclidean space
- special case
- finding optimal solutions
- greedy algorithm
- vc dimension
- traveling salesman problem
- linear programming
- search algorithm
- neural network