NP-hard optimization problems exhibit a rich set of possibilities, all the way from allowing approximability to any required degree, to essentially not allowing approximability at all. Despite this diversity, underlying the process of design of approximation algorithms are some common principles. We will explore these in the current chapter.
Unable to display preview. Download preview PDF.
- S.A. Cook. The complexity of theorem-proving procedures. In Proc. 3rd ACM Symposium on the Theory of Computing, pages 151–158, 1971.Google Scholar
- L.A. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115–116, 1973. English translation in Problems of Information Transmission 9: 265–266.Google Scholar
- P. Erdös. Grâfok pá.ros körüljárisn részgráfjairôl (On bipartite subgraphs of graphs, in Hungarian). Mat. Lapok, 18:283–288, 1967.Google Scholar
- M.R. Garey, R.L. Graham, and J.D. Ullman. An analysis of some packing algorithms. In Combinatorial Algorithms (Courant Computer Science Symposium, No. 9), pages 39–47, 1972.Google Scholar
- M.O. Rabin. Probabilistic algorithms. In J.F. Traub, editor, Algorithms and Complexity, Recent Results and New Directions, pages 21–39. Academic Press, New York, NY, 1976.Google Scholar
- R.E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.Google Scholar
- G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer-Verlag, Berlin, 1999.Google Scholar