Local Search Approximation Algorithms for the Spherical k-Means Problem.
Dongmei ZhangYukun ChengMin LiYishui WangDachuan XuPublished in: AAIM (2019)
Keyphrases
- approximation algorithms
- k means
- np hard
- special case
- clustering algorithm
- search algorithm
- vertex cover
- minimum cost
- optimal solution
- network design problem
- worst case
- search space
- facility location problem
- approximation ratio
- set cover
- open shop
- memetic algorithm
- exact algorithms
- genetic algorithm
- tabu search
- simulated annealing
- approximation schemes
- np hardness
- disjoint paths
- job shop scheduling problem
- undirected graph
- constant factor
- randomized algorithms
- constant factor approximation