Summary: 54 CHAPTER 10 HARDNESS OF APPROXIMATIONS
Sha92. A. Shamir. IP = PSPACE. J. of the ACM, 39(4):869--877, October 1992.
Sim90. H. U. Simon. On approximate solutions for combinatorial optimization
problems. SIAM J. Algebraic Discrete Methods, 3:294--310, 1990.
Sud92. Madhu Sudan. Efficient checking of polynomials and proofs and the
hardness of approximation problems. PhD thesis, U.C. Berkeley, 1992.
Yan79. M. Yannakakis. The effect of a connectivity requirement on the
complexity of of maximum subgraph problems. Journal of the ACM,
Yan81. M. Yannakakis. Edge deletion problems. SIAM Journal of Computing,
Yan92. M. Yannakakis. On the approximation of maximum satisfiability. In
Proceedings of 3rd Annual ACMSIAM Symposium on Discrete
Algorithms, pages 1--9, 1992.
Zuc93. D. Zuckerman. NPcomplete problems have a version that's hard to
approximate. In 8th Structure in Complexity Theory Conf., pages
KMR93. D. Karger, R. Motwani, and G.D.S. Ramkumar. On approximating the