Approximation Algorithms for QMA-Complete Problems.
Sevag GharibianJulia KempePublished in: SIAM J. Comput. (2012)
Keyphrases
- approximation algorithms
- vertex cover
- np hard
- randomized algorithms
- special case
- np hardness
- optimization problems
- worst case
- exact algorithms
- network design problem
- np complete
- approximation schemes
- primal dual
- precedence constraints
- minimum cost
- facility location problem
- combinatorial optimization
- upper bound
- open shop