Improved Approximation Algorithms for Tverberg Partitions.
Sariel Har-PeledTimothy ZhouPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- precedence constraints
- primal dual
- exact algorithms
- facility location problem
- constant factor
- approximation schemes
- open shop
- set cover
- approximation ratio
- undirected graph
- network design problem
- np hardness
- randomized algorithms
- theoretical analysis
- branch and bound algorithm
- search algorithm
- disjoint paths