Approximation Algorithms and Hardness for Strong Unique Games.
Suprovat GhoshalAnand LouisPublished in: SODA (2021)
Keyphrases
- approximation algorithms
- np hard
- worst case
- np hardness
- special case
- minimum cost
- vertex cover
- facility location problem
- lower bound
- game theory
- network design problem
- approximation ratio
- open shop
- upper bound
- disjoint paths
- set cover
- randomized algorithms
- computational complexity
- undirected graph
- primal dual
- linear program
- combinatorial auctions
- approximation schemes
- optimal solution
- precedence constraints
- exact algorithms
- constant factor
- polynomial time approximation
- branch and bound algorithm