Parameterized Approximation Algorithms and Lower Bounds for k-Center Clustering and Variants.
Sayan BandyapadhyayZachary FriggstadRamin MousaviPublished in: Algorithmica (2024)
Keyphrases
- approximation algorithms
- lower bound
- np hard
- worst case
- upper bound
- constant factor
- special case
- minimum cost
- vertex cover
- set cover
- clustering algorithm
- randomized algorithms
- primal dual
- network design problem
- facility location problem
- approximation guarantees
- approximation ratio
- integrality gap
- branch and bound
- np hardness
- integer programming
- linear programming
- open shop
- greedy algorithm
- data points
- exact algorithms
- branch and bound algorithm
- approximation schemes
- constant factor approximation
- precedence constraints
- network flow
- vc dimension
- randomized algorithm
- polynomial time approximation
- disjoint paths
- min cost
- lagrangian relaxation
- randomly generated problems
- sample complexity
- scheduling problem
- computational complexity