On Fixed-Parameter Tractability and Approximability of NP Optimization Problems

Journal of Computer and System Sciences

Volumn 54, Issue 3, 1997, Pages 465-474

  Cai, Liming ^a   Chen, Jianer ^b  

^a Ohio University   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

FIXED PARAMETER TRACTABILITY; NP OPTIMIZATION PROBLEMS; POLYNOMIAL TIME APPROXIMATION;

COMPUTATIONAL COMPLEXITY;

EID: 0031164842     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1490     Document Type: Article

References (22)

1. K. R. Abrahamson, R. G. Downey, and M. R. Fellows, "Fixed Parameter Intractability, II," Lecture Notes in Computer Science, Vol. 665, pp. 374-385, Springer-Verlag, New York/Berlin, 1993.
2. K. R. Abrahamson, R. G. Downey, and M. R. Fellows, Fixed parameter intractability and completeness IV: On completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic 73 (1995), 235-276.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and intractability of approximation problems, in "Proceedings, 33th IEEE Symposium on Foundations of Computer Science, 1992," pp. 14-23.
4. A. Blummer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36 (1989), 929-965.
5. H. L. Bodlaender, M. R. Fellows, and M. T. Hallett, Beyond NP-completeness for problems of bounded width: Hardness for the W-hierarchy, in "Proc. 26th ACM Symposium on Theory of Computing, 1994," pp. 449-458.
6. J. F. Buss and J. Goldsmith, Nondeterminism within P, SIAM J. Comput. 22 (1993), 560-572.
7. L. Cai and J. Chen, "On the Amount of Nondeterminism and the Power of Verifying," Lecture Notes in Computer Science, Vol. 711, pp. 311-320, Springer-Verlag, New York/Berlin, 1993; SIAM J. Comput., to appear.
8. L. Cai and J. Chen, "On the Amount of Nondeterminism and the Power of Verifying," Lecture Notes in Computer Science, Vol. 711, pp. 311-320, Springer-Verlag, New York/Berlin, 1993; SIAM J. Comput., to appear.
9. L. Cai and J. Chen, On input read-modes of alternating Turing machines, Theoret. Comput. Sci. 148 (1995), 33-55.
10. L. Cai, J. Chen, R. G. Downey, and M. R. Fellows, On the structure of parameterized problems in NP, Inform. and Comput. 123 (1995), 38-49.
11. J. Díaz and J. Torán, Classes of bounded nondeterminism, Math. System Theory 23 (1990), 21-32.
12. R. G. Downey and M. R. Fellows, Fixed-parameter intractability, in "Proc. 7th Structure in Complexity Theory Conference, 1992," pp. 36-49.
13. R. G. Downey and M. R. Fellows, Fixed-parameter intractability and completeness I: basic results, SIAM J. Comput. 24 (1995), 873-921.
14. M. R. Fellows, private communication, 1992.
15. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco, 1979.
16. O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. Assoc. Comput. Mach. 22 (1975), 463-468.
17. P. G. Kolaitis and M. N. Thakur, Approximation properties of NP minimization classes, J. Comput. System Sci. 50 (1995), 391-411.
18. E. W. Leggett, Jr. and D. J. Moore, Optimization problems and the polynomial hierarchy, Theoret. Comput. Sci. 15 (1981), 279-289.
19. C. H. Papadimitriou and M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991), 425-440.
20. C. H. Papadimitriou and M. Yannakakis, On limited nondeterminism and the complexity of the V-C dimension in "Proc. 8th Structure in Complexity Theory Conference, 1993," pp. 12-18,
21. S. Sahni, Algorithms for scheduling independent tasks, J. Assoc. Comput. Mach. 23 (1976), 116-127.
22. A. Yao, Separating the polynomial-time hierarchy by oracles, in "Proc. 26th Annual Symposium on Foundations of Computer Science, 1985," pp. 1-10.