Approximation Algorithms for Spherical k-Means Problem with Penalties Using Local Search Techniques.
Xiaoyun TianLing GaiYicheng XuDongmei ZhangPublished in: Asia Pac. J. Oper. Res. (2023)
Keyphrases
- approximation algorithms
- k means
- np hard
- special case
- search algorithm
- vertex cover
- worst case
- facility location problem
- memetic algorithm
- search space
- network design problem
- clustering algorithm
- combinatorial optimization
- primal dual
- optimal solution
- minimum cost
- tabu search
- genetic algorithm
- randomized algorithms
- open shop
- approximation schemes
- exact algorithms
- set cover
- approximation ratio
- search procedure
- expectation maximization
- simulated annealing
- scheduling problem
- np hardness
- combinatorial auctions
- lower bound
- constant factor approximation
- integer programming
- job shop scheduling problem
- undirected graph
- linear programming
- learning algorithm