Polynomial Time Approximation Schemes and Parameterized Complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3153, Issue , 2004, Pages 500-512

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

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PARAMETERIZATION; POLYNOMIALS; PROGRAM PROCESSORS;

APPROXIMABILITY; FIXED-PARAMETER TRACTABILITY; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; GENERAL CONSTRAINTS; NP OPTIMIZATION PROBLEMS; PARAMETERIZED COMPLEXITY; PLANARITY; POLYNOMIAL TIME APPROXIMATION SCHEMES;

POLYNOMIAL APPROXIMATION;

EID: 21144445656     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_38     Document Type: Article

References (23)

1. J. ALBER, H. BODLAENDER, H. FERNAU, T. KLOKS, AND R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica 33, (2002), pp. 461-493.
2. 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, (1999).
3. G. AUSIELLO, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Toward a unified approach for the classification of NP-complete optimization problems, Theoretical Computer Science. 12, (1980), pp. 83-96.
4. S. ARORA, Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems, J. ACM 45, (1998), pp. 753-782.
5. B. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41, (1994), pp. 153-180.
6. L. CAI AND J. CHEN, On fixed-parameter tractability and approximability of NP optimization problems, Journal of Computer and System Sciences 54, (1997), pp. 465-474.
7. L. CAI, M. FELLOWS, D. JUEDES AND F. ROSAMOND, On efficient polynomialtime approximation schemes for problems on planar structures, Journal of Computer and System Sciences, to appear.
8. M. CESATI AND L. TREVISAN, On the efficiency of polynomial time approximation schemes, Information Processing Letters 64, (1997), pp. 165-171.
9. J. CHEN, Characterizing parallel hierarchies by reducibilities, Information Processing Letters 39, (1991), pp. 303-307.
10. J. CHEN AND A. MIRANDA, A polynomial time approximation scheme for general multiprocessor job scheduling, SIAM J. on Comp. 31, (2001), pp. 1-17.
11. R. DOWNEY, Parameterized complexity for the skeptic, Proc. 18th IEEE Annual Conference on Computational Complexity (CCC'03), (2003), pp. 132-153.
12. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, Springer-Verlag, (1999).
13. M. FELLOWS, Parameterized complexity: the main ideas and some research frontiers, LNCS 2223 (ISAAC'01), pp. 291-307, Springer-Verlag, Berlin (2001).
14. M. FRICK AND M. GROHE, Deciding first-order properties of locally treedecomposable structures, J. ACM 48, (2001), pp. 1184-1206.
15. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, H. Freeman, New York, (1979).
16. D. HOCHBAUM, Approximation Algorithms for NP-hard Problems, PWS Publishing Company, Boston, MA, 1997.
17. O. IBARRA AND C. KIM, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM 22, (1975), pp. 463-468.
18. S. KHANNA AND R. MOTWANI, Towards a syntactic characterization of PTAS, Proc. 28th Annual ACM Symp. on Theory of Computing (STOC'96), (1996), pp. 468-477.
19. S. KHANNA, R. MOTWANI, M. SUDAN, AND U. VAZIRANI, On syntactic versus computational views of approximability, SIAM J. on Comp. 28, (1998), pp. 164-191.
20. A. PAZ AND S. MORAN, Non deterministic polynomial optimization problems and their approximations, Theoretical Computer Science 15, (1981), pp. 251-277.
21. G. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43, (1991), pp. 425-440.
22. S. SAHNI, Algorithms for scheduling independent tasks, J. ACM 23, (1976), pp. 116-127.
23. G. WOEGINGER, When does a dynamic programming formulation guarantee the existence of an FPTAS? Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'99), (1999), pp. 820-829.