Reductions, completeness and the hardness of approximability

European Journal of Operational Research

Volumn 172, Issue 3, 2006, Pages 719-739

  Ausiello, G ^a   Paschos, V Th ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation preserving reduction; Combinatorial optimization; Completeness in approximation classes; Complexity theory; Computing science; NP hard optimization problems; Polynomial approximation

Indexed keywords

COMPUTABILITY AND DECIDABILITY; MAPPING; OPERATIONS RESEARCH; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

APPROXIMATION PRESERVING REDUCTION; COMBINATORIAL OPTIMIZATION; COMPLETENESS IN APPROXIMATION CLASSES; COMPLEXITY THEORY;

APPROXIMATION THEORY;

EID: 33645943722     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.06.006     Document Type: Review

References (30)

1. Bell E.T. The Development of Mathematics (1992), Dover
2. Kleene S.C. Introduction to Metamathematics (1952), Van Nostrand, Princeton, NJ
3. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
4. N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Technical Report 388, Graduate School of Industrial Administration, CMU, 1976.
5. Garey M.R., and Johnson D.S. Computers and intractability. A guide to the theory of NP-completeness (1979), W.H. Freeman, San Francisco
6. Graham R.L. Bounds for multiprocessing timing anomalies. SIAM Journal of Applied Mathematics 17 (1969) 263-269
7. Johnson D.S. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9 (1974) 256-278
8. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties (1999), Springer, Berlin
9. Demange M., and Paschos V. Polynomial approximation algorithms with performance guarantees: An introduction-by-example. European Journal of Operational Research 165 (2005) 555-568 invited tutorial
10. P. Orponen, H. Mannila, On approximation preserving reductions: Complete problems and robust measures, Techical Report C-1987-28, Department of Computer Science, University of Helsinki, Finland, 1987.
11. Ausiello G., D'Atri A., and Protasi M. Lattice-theoretical ordering properties for NP-complete optimization problems. Fundamenta Informaticæ 4 (1981) 83-94
12. Paz A., and Moran S. Non deterministic polynomial optimization problems and their approximations. Theoretical Computer Science 15 (1981) 251-277
13. S.A. Cook, The complexity of theorem-proving procedures, in: Proceedings of the STOC'71, 1971, pp. 151-158.
14. Crescenzi P., Kann V., Silvestri R., and Trevisan L. Structure in approximation classes. SIAM Journal of Computing 28 5 (1999) 1759-1782
15. Simon H.U. On approximate solutions for combinatorial optimization problems. SIAM Journal of Discrete Mathematics 3 2 (1990) 294-310
16. Paschos V. Complexité et approximation polynomiale (2004), Hermès, Paris
17. Crescenzi P., and Panconesi A. Completeness in approximation classes. Information and Computation 93 2 (1991) 241-262
18. Ausiello G., Crescenzi P., and Protasi M. Approximate solutions of NP optimization problems. Theoretical Computer Science 150 (1995) 1-55
19. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, in: Proceedings of the FOCS'92, 1992, pp. 14-23.
20. L. Trevisan, G.B. Sorkin, M. Sudan, D.P. Williamson, Gadgets, approximation, and linear programming, in: Proceedings of the FOCS'96, 1996, pp. 617-626.
21. Papadimitriou C.H., and Yannakakis M. Optimization, approximation and complexity classes. Journal of Computer and System Sciences 43 (1991) 425-440
22. Arora S., and Lund C. Hardness of approximation. In: Hochbaum D.S. (Ed). Approximation Algorithms for NP-hard Problems (1997), PWS, Boston 399-446 (Chapter 10)
23. Demange M., and Paschos V. On an approximation measure founded on the links between optimization and polynomial approximation theory. Theoretical Computer Science 158 (1996) 117-141
24. Demange M., Grisoni P., and Paschos V. Differential approximation algorithms for some combinatorial optimization problems. Theoretical Computer Science 209 (1998) 107-122
25. Ausiello G., D'Atri A., and Protasi M. Structure preserving reductions among convex optimization problems. Journal of Computer and System Sciences 21 (1980) 136-153
26. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-103
27. Khanna S., Motwani R., Sudan M., and Vazirani U. On syntactic versus computational views of approximability. SIAM Journal of Computing 28 (1998) 164-191
28. P. Crescenzi, A short guide to approximation preserving reductions, in: Proceedings of the Conference on Computational Complexity, 1997, pp. 262-273.
29. Ausiello G., Bazgan C., Demange M., and Paschos V. Completeness in differential approximation classes. In: Roban B., and Vojtás P. (Eds). Proceedings of the Mathematical Foundations of Computer Science, MFCS'03. Lecture Notes in Computer Science 2747 (2003), Springer-Verlag 179-188
30. Bazgan C., Escoffier B., and Paschos V. Poly-apx- and ptas-completeness in standard and differential approximation. In: Fleischer R., and Trippen G. (Eds). Proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC'04. Lecture Notes in Computer Science 3341 (2004), Springer-Verlag 124-136