This chapter is centered around problems and issues currently in vogue in the field of approximation algorithms. Important new issues are bound to arise in the future. With each of these problems two questions arise — that of obtaining the best approximation guarantee and a matching hardness result1
Unable to display preview. Download preview PDF.
- 64.I. Dinur, V. Guruswami, S. Khot, and O. Regev. The hardness of hypergraph vertex cover. Manuscript, 2002.Google Scholar
- 43.C. Chekuri, A. Gupta, and A. Kumar. On the bidirected relaxation for the multiway cut problem. Manuscript, 2002.Google Scholar
- 58.M. Cryan, M. Dyer, L. Goldberg, M. Jerrum, and R. Martin. A polynomial-time alogarithm to approximately count contingency tables when the number of rows is constant. In Proc. 43rd IEEE Annual Symposium on Foundations of Computer Science, 2002.Google Scholar
- 69.M. Dyer. Approximate counting by dynamic programming. Manuscript, 2002.Google Scholar