Login / Signup
Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions.
Anne Condon
Joan Feigenbaum
Carsten Lund
Peter W. Shor
Published in:
STOC (1993)
Keyphrases
</>
approximation algorithms
np hard
special case
dynamic programming
minimum cost
constant factor
vertex cover
primal dual
set cover
facility location problem
disjoint paths
undirected graph
np hardness
randomized algorithms