Polynomial time approximation schemes and parameterized complexity

Discrete Applied Mathematics

Volumn 155, Issue 2, 2007, Pages 180-193

  Chen, Jianer ^a,b   Huang, Xiuzhen ^c   Kanj, Iyad A ^d   Xia, Ge ^e  

^a TEXAS A AND M UNIVERSITY   (United States)

^b CENTRAL SOUTH UNIVERSITY   (China)

^c ARKANSAS STATE UNIVERSITY   (United States)

^d DEPAUL UNIVERSITY   (United States)

^e LAFAYETTE COLLEGE   (United States)

Author keywords

Approximation algorithm; Parameterized complexity; Polynomial time approximation scheme; W hierarchy

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; PARAMETERIZED COMPLEXITY; POLYNOMIAL TIME APPROXIMATION SCHEME; W-HIERARCHY;

POLYNOMIAL APPROXIMATION;

EID: 33751185100     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.040     Document Type: Article

References (24)

1. Alber J., Bodlaender H., Fernau H., Kloks T., and Niedermeier R. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33 (2002) 461-493
2. Arora S. Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45 (1998) 753-782
3. 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
4. Ausiello G., Marchetti-Spaccamela A., and Protasi M. Toward a unified approach for the classification of NP-complete optimization problems. Theoret. Comput. Sci. 12 (1980) 83-96
5. Baker B. Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41 (1994) 153-180
6. Cai L., and Chen J. On fixed-parameter tractability and approximability of NP optimization problems. J. Comput. System Sci. 54 (1997) 465-474
7. L. Cai, M. Fellows, D. Juedes, F. Rosamond, On efficient polynomial-time approximation schemes for problems on planar structures, Preprint, 2002.
8. Cesati M., and Trevisan L. On the efficiency of polynomial time approximation schemes. Inform. Process. Lett. 64 (1997) 165-171
9. Chen J. Characterizing parallel hierarchies by reducibilities. Inform. Process. Lett. 39 (1991) 303-307
10. Chen J., and Miranda A. A polynomial time approximation scheme for general multiprocessor job scheduling. SIAM J. Comput. 31 (2001) 1-17
11. Downey R. Parameterized complexity for the skeptic. Proceedings of the 18th IEEE Annual Conference on Computational Complexity (CCC'03) (2003) 132-153
12. Downey R., and Fellows M. Parameterized Complexity (1999), Springer, Berlin
13. M. Fellows, Parameterized Complexity: the Main Ideas and Some Research Frontiers, Lecture Notes in Computer Science, vol. 2223 (ISAAC'01), Springer, Berlin, 2001, pp. 291-307.
14. Frick M., and Grohe M. Deciding first-order properties of locally tree-decomposable structures. J. ACM 48 (2001) 1184-1206
15. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman, New York
16. Hastad J. Computational Limitations for Small-Depth Circuits (1986), The MIT Press, Cambridge, MA
17. Hochbaum D. Approximation Algorithms for NP-hard Problems (1997), PWS Publishing Company, Boston, MA
18. Ibarra O., and Kim C. Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22 (1975) 463-468
19. Khanna S., and Motwani R. Towards a syntactic characterization of PTAS. Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC'96) (1996) 468-477
20. Khanna S., Motwani R., Sudan M., and Vazirani U. On syntactic versus computational views of approximability. SIAM J. Comput. 28 (1998) 164-191
21. Papadimitriou C., and Yannakakis M. Optimization, approximation, and complexity classes. J. Comput. System Sci. 43 (1991) 425-440
22. Paz A., and Moran S. Non deterministic polynomial optimization problems and their approximations. Theoret. Comput. Sci. 15 (1981) 251-277
23. Sahni S. Algorithms for scheduling independent tasks. J. ACM 23 (1976) 116-127
24. Woeginger G. When does a dynamic programming formulation guarantee the existence of an FPTAS?. Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'99) (2001) 820-829