The inapproximability of non-NP-hard optimization problems

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 553-571

  Cai, Liming ^a   Juedes, David ^a   Kanj, Iyad ^b  

^a US Institute of Navigation   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

Approximation hardness; Combinatorial optimization; Computational complexity; Reductions

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL OPTIMIZATIONS;

COMPUTATIONAL COMPLEXITY;

EID: 0037163950     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00343-7     Document Type: Article

References (27)

1. S. Arora, Personal communication.
2. Arora S., Lund C. Hardness of approximations. Hochbaum D. Approximation Algorithms for NP-hard problems. 1997;399-446 PWS Publishing, Boston.
3. S. Arora, C. Lund, R. Motwani, M. Sundar, M. Szegedy, Verification and hardness of approximation problems, in: Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science, Los Alamitos, CA, IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 14-23.
4. S. Arora, S. Safra, Probabilistic checking of proofs, in: Proc. 33rd Ann. Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 2-13.
5. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti Spaccamela A., Protasi M. Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. 1999;Springer, Berlin.
6. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistic checking of proofs and applications to approximation, in: Proc. 25th Ann. ACM Symp. on the Theory of Computing, New York, 1993, ACM Press, New York, pp. 294-304.
7. Boppana R., Halldórsson M.M. Approximating maximum independent sets by excluding subgraphs. BIT. 32:1992;180-196.
8. Buss J.F., Goldsmith J. Nondeterminism within P. SIAM J. Comput. 22:1993;560-572.
9. Cai L., Chen J. On fixed-parameter tractability and approximability of NP optimization problems. J. Comput. System Sci. 54(3):1997;465-474.
10. Cai L., Chen J. On the amount of nondeterminism and the power of verifier. SIAM J. Comput. 26(3):1997;733-750.
11. Cai L., Chen J., Downey R., Fellows M. On the structure of parameterized problems in NP. Inform. Comput. 123:1995;38-49.
12. Díaz J., Torán J. Classes of bounded nondeterminism. Math. System Theory. 23:1990;21-32.
13. R.G. Downey, M.R. Fellows, Fixed-parameter intractability, in: Proc. Seventh Ann. Conf. Structure in Complexity Theory, Boston, MA, USA, IEEE Computer Society Press, Silver Spring, MD, 1992, pp. 36-49.
14. Downey R.G., Fellows M.R. Fixed-parameter tractability and completeness I: Basic results. SIAM J. Comput. 24(4):1995;873-921.
15. R.G. Downey, M.R. Fellows, Parameterized computational feasibility, in: FEASMATH: Feasible Mathematics: A Mathematical Sciences Institute Workshop, Birkhauser, 1995.
16. Farr G. On problems with short certificates. Acta Inform. 31:1994;479-502.
17. U. Feige, S. Goldwasser, L. Lovász, S. Safra, M. Szegedy, Approximating clique is almost NP-complete, in: Proc. 32nd IEEE Symp. on the Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1991, pp. 2-12.
18. Feige U., Kilian J. On limited versus polynomial nondeterminism. Chicago J. Theoret. Comput. Sci. 1997:1997;1-20.
19. U. Feige, A threshold of ln n for approximating set cover (preliminary version), in: Proc. 28th Ann. ACM Symp. on the Theory of Computing, Philadelphia, Pennsylvania, 22-24 May 1996, pp. 314-318.
20. D. Fotakis, P. Spirakis, (poly(log log n), poly(log log n))-restricted verifiers are unlikely to exist for languages in NP, in: Proc. 23nd Internat. Symp. on Mathematical Foundations of Computer Science, Springer, Berlin, 1996, pp. 360-371.
21. Goldsmith J., Levy M., Mundhenk M. Guest column: Limited nondeterminism. SIGACT News. 27(2):1996;20-29.
22. Johnson D.S. Approximation algorithms for combinatorial problems. J. Comput. Systems Sci. 9:1974;256-278.
23. V. Kann, On the Approximability of NP-complete Optimization Problems, Ph.D. Thesis, Royal Institute of Technology, Sweden, 1992.
24. Megiddo N., Vishkin U. On finding a minimum dominating set in a tournament. Theoret. Comput. Sci. 61:1988;307-316.
25. C.H. Papadimitriou, M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension, in: Proc. Eigth Ann. Conf. on Structure in Complexity Theory (SCTC '93), San Diego, CA, USA, IEEE Computer Society Press, Silver Spring, MD, 1993, pp. 12-18.
26. 1-ε, in: Proc. 37th Ann. IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1996, pp. 627-636.
27. k-complete problems and greediness, Tech. Rep. 445, Computer Science Department, University, Rochester, NY, 1993.