Approximation Algorithms for Min-Distance Problems.
Mina DalirrooyfardVirginia Vassilevska WilliamsNikhil VyasNicole WeinYinzhan XuYuancheng YuPublished in: ICALP (2019)
Keyphrases
- approximation algorithms
- vertex cover
- special case
- np hard
- randomized algorithms
- approximation schemes
- minimum cost
- np hardness
- exact algorithms
- partial order
- np complete
- open shop
- network design problem
- facility location problem
- longest common subsequence
- search space
- set cover
- approximation ratio
- quadratic program
- primal dual