Approximation Algorithms for QMA-Complete Problems.

Sevag Gharibian Julia Kempe

Published in: Computational Complexity Conference (2011)

Keyphrases

approximation algorithms
vertex cover
np hardness
np hard
exact algorithms
primal dual
network design problem
randomized algorithms
special case
approximation schemes
set cover
linear program
minimum cost
practical problems
worst case
np complete
optimal solution
dynamic programming
facility location problem