Parameterized Approximation Algorithms for K-center Clustering and Variants.
Sayan BandyapadhyayZachary FriggstadRamin MousaviPublished in: AAAI (2022)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- clustering algorithm
- minimum cost
- network design problem
- facility location problem
- approximation ratio
- exact algorithms
- randomized algorithms
- polynomial time approximation
- primal dual
- approximation schemes
- constant factor
- set cover
- k means
- undirected graph
- information theoretic
- disjoint paths
- precedence constraints
- closest string
- constant factor approximation
- open shop
- similarity function
- data points
- lower bound