Improved approximation algorithms for two Euclidean k-Center variants.
Haris AngelidakisIvan SergeevPontus WestermarkPublished in: CoRR (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- exact algorithms
- set cover
- approximation ratio
- randomized algorithms
- constant factor
- open shop
- primal dual
- network design problem
- facility location problem
- np hardness
- combinatorial auctions
- euclidean distance
- approximation schemes
- disjoint paths
- precedence constraints
- undirected graph
- constant factor approximation