Parameterized Approximation Algorithms for k-Center Clustering and Variants.
Sayan BandyapadhyayZachary FriggstadRamin MousaviPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- facility location problem
- primal dual
- clustering algorithm
- network design problem
- set cover
- k means
- randomized algorithms
- data points
- approximation ratio
- approximation schemes
- disjoint paths
- exact algorithms
- constant factor
- open shop
- np hardness
- knapsack problem