Abstract
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
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Notes
I. Dinur, V. Guruswami, S. Khot, and O. Regev. The hardness of hypergraph vertex cover. Manuscript, 2002.
C. Chekuri, A. Gupta, and A. Kumar. On the bidirected relaxation for the multiway cut problem. Manuscript, 2002.
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.
M. Dyer. Approximate counting by dynamic programming. Manuscript, 2002.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Vazirani, V.V. (2003). Open Problems. In: Approximation Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04565-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-662-04565-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-08469-0
Online ISBN: 978-3-662-04565-7
eBook Packages: Springer Book Archive