The complexity of polynomial-time approximation

Theory of Computing Systems

Volumn 41, Issue 3, 2007, Pages 459-477

  Cai, Liming ^a   Fellows, Michael ^b   Juedes, David ^c   Rosamond, Frances ^b  

^a University of Georgia ^*  (United States)

^b UNIVERSITY OF NEWCASTLE   (Australia)

^c Ohio University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FIXED-PARAMETER TRACTABLE ALGORITHMS; MULTIPLICATIVE FACTORS; OPTIMIZATION PROBLEMS; PARAMETERIZED COMPLEXITY; PLANAR STRUCTURE; POLYNOMIAL TIME APPROXIMATION; POLYNOMIAL TIME APPROXIMATION SCHEMES; PROBLEM PARAMETERS;

ALGORITHMS; CONSTRAINED OPTIMIZATION; PARAMETER ESTIMATION;

POLYNOMIAL APPROXIMATION;

EID: 36849056503     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-007-1346-y     Document Type: Conference Paper

References (26)

1. S. Arara, Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems, Proc. 38th Annual IEEE Symposium on the Foundations of Computing (FOCS '97), pp. 554-563, IEEE Press, Piscataway, NJ, 1997.
2. 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), 461-493.
3. N. Alon, P. Seymour, and R. Thomas, A Separator Theorem for Nonplanar Graphs, J. Amer. Math. Soc. 3 (1990), 801-808.
4. B. Baker, Approximation Algorithms for NP-Complete Problems on Planar Graphs, J. ACM 41 (1994), 153-180.
5. C. Bazgan, Schémas d'approximation et complexité paramétrée, Rapport de stage de DEA d'Informatique à Orsay, 1995.
6. H. Bodlaender, Dynamic Programming on Graphs with Bounded Treewidth, Proc. ICALP 1988, pp. 105-118, Lecture Notes in Computer Science 317, Springer-Verlag, Berlin, 1988.
7. H. Bodlaender, Treewidth.: Algorithmic Techniques and Results, Proceedings of MFCS 1997, pp. 19-36, Lecture Notes in Computer Science 1295, Springer-Verlag, Berlin, 1997.
8. L. Cai and J. Chen, On Fixed-Parameter Tractability and Approximability of NP Optimization Problems, J. Comput. System Sci. 54 (1997), 465-474.
9. J. Chen, X. Huang, I. Kanj and G. Xia, Polynomial-Time Approximation Schemes and Param-eterized Complexity, Proc. 29th International Symposium on the Mathematical Foundations of Computer Science (MFCS 2004), pp. 500-512, Lecture Notes in Computer Science 3153, SpringerVerlag, Berlin, 2004.
10. L. Cai and D. Juedes, Subexponential Parameterized Algorithms Collapse the W-Hierarchy, Proc. ICALP 200.1, pp. 273-284, Lecture Notes in Computer Science 2076, Springer-Verlag, Berlin, 200.1.
11. M. Cesati and L. Trevisan, On the Efficiency of Polynomial Time Approximation Schemes, Inform. Process. Lett. 64 (1997), 165-171.
12. R. G. Downey, Parameterized Complexity for the Skeptic, Proc. 18th IEEE Annual Conference on Computational Complexity, pp. 147-169, IEEE Press, Piscataway, NJ, 2003.
13. R. Downey and M. Fellows, Parameterized Complexity, Springer-Verlag, New York, 1999.
14. E. Demaine and M. Hajiaghayi, Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors and Local Treewidth, Proc. 12th International Symposium on Graph Drawing (GD 2004), pp. 517-533, Lecture Notes in Computer Science 3383, Springer-Verlag, Berlin, 2004.
15. E. Demaine and M. Hajiaghayi, Graphs Excluding a Fixed Minor have Grids as Large as Treewidth, with Combinatorial and Algorithmic Applications through Bidimensionality, Proc. 16th ACMSIAM Symposium on Discrete Algorithms (SODA) 2005, pp. 682-689, ACM Press, New York, 2005.
16. E. Demaine and M. Hajiaghayi, Bidimensionality: New Connections between FPT Algorithms and PTASs, Proc. 16th ACM-SIAM Symposium on Discrete Algorithms (SODA) 2005, pp. 590-601, ACM Press, New York, 2005.
17. M. Fellows, Parameterized Complexity: The Main Ideas and Connections to Practical Computing, in Experimental Algorithmics, pp. 51-77, Lecture Notes in Computer Science 2547, Springer-Verlag, Berlin, 2002.
18. M. Fellows, New Directions and New Challenges in Algorithm Design and Complexity, Parameterized, Proc. Workshop on Algorithms and Data Structures (WADS 2003), pp. 505-520, Lecture Notes in Computer Science 2748, Springer-Verlag, Berlin, 2003.
19. J. Gramm, J. Guo, and R. Niedermeier, On Exact and Approximation Algorithms for Distinguishing Substring Selection, Proc. FCT 2003, pp. 195-209, Lecture Notes in Computer Science 2751, Springer-Verlag, Berlin, 2003.
20. O. Goldreich, S. Goldwasser, and D. Ron, Proc. 31th IEEE Conference on Foundations of ComputerScience (FOCS), pp. 339-348, IEEE Press, Piscataway, NJ, 1996.
21. H. B. Hunt III, M. Marathe, V. Radhakrishnan, S. Ravi, D. Rosenkrantz, and R. Stearns, NC-Approximation Schemes for NP- and PSPACE-hard Problems on Geometric Graphs, J. Algorithms 26 (1998), 238-274.
22. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
23. X. Huang, Parameterized Complexity and Polynomial-Time Approximation Schemes, Ph.D. Thesis, Texas A&M University, 2004.
24. S. Khanna and R. Motwani, Towards a Syntactic Characterization of PTAS, Proc. STOC 1996, pp. 329-337, ACM Press, New York, 1996.
25. D. Marx, Efficient Approximation Schemes for Geometric Problems? Proc. European Symposium on Algorithms, pp. 448-459, 2005.
26. D. Marx, The Closest Substring Problems with Small Distances, Proc. FOCS 2005, pp. 63-72, IEEE Press, Piscataway, NJ, 2005.