Approximation Algorithms and Hardness for Strong Unique Games.
Suprovat GhoshalAnand LouisPublished in: CoRR (2020)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- set cover
- minimum cost
- facility location problem
- randomized algorithms
- np complete
- exact algorithms
- computational complexity
- approximation ratio
- network design problem
- primal dual
- game theory
- upper bound
- lower bound
- precedence constraints
- scheduling problem
- information theoretic
- constant factor
- open shop
- disjoint paths
- integer programming
- greedy algorithm
- greedy heuristic
- approximation schemes
- learning algorithm