Fixed-parameter approximation: Conceptual framework and approximability results

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

Volumn 4169 LNCS, Issue , 2006, Pages 96-108

  Cai, Liming ^a   Huang, Xiuzhen ^b  

^a University of Georgia ^*  (United States)

^b ARKANSAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

APPROXIMATE COMPUTATIONS; PARAMETER COMPUTATION; POLYNOMIAL TIME;

COMPUTATION THEORY;

EID: 33750238492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11847250_9     Document Type: Conference Paper

References (26)

1. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: exponential speed-up for planar graph problems, J. Algorithms 52, pp. 26-56, (2004).
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. B. S. BAKER, Approximation algorithms for NP-complete problems on planar graphs, Journal of the ACM 41, pp. 153-180, (1994).
4. H. BODLAENDER, unpublished manuscipt.
5. H. L. BODLAENDER, A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25, pp. 1305-1317, (1996).
6. H. BODLAENDER AND M. R. FELLOWS, unpublished manuscipt.
7. L. CAI AND J. CHEN, On fixed-parameter tractability and approximability of NP optimization problems, J. of Comp. and Sys. Sciences 54, pp. 465-474, (1997).
8. L. CAI AND J. CHEN, On the amount of nondeterminism and the power of verifying, SIAM Journal of Computing 26. pp. 733-750, (1997).
9. L. CAI, J. CHEN, R. DOWNEY, AND M. FELLOWS, On the structure of parameterized problems in NP, Information and Computation 123, pp. 38-49, (1995).
10. L. CAI AND D.W. JUEDES, On the existence of sub-exponential time parameterized algorithms, Journal of Computer and System Sciences 67, pp. 789-807, 2003.
11. L. CAI, D. JUEDES, AND I. KANJ, The inapproximability of non NP-hard optimization problems, Theoretical Computer Science 289, pp. 553-571, (2002).
12. J. CHEN, I. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, Journal of Algorithms 41, pp. 280-301, (2001).
13. J. CHEN, I. KANJ, G. XIA, Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems, Algorithmica 43, pp. 245-273, (2005).
14. R. G. DOWNEY AND M. R. FELLOWS, Fixed-parameter intractability, Proc. of the 7th Annual Conference on Structure in Complexity Theory, pp. 36-49, (1992).
15. R. G. DOWNEY AND M. R. FELLOWS, Fixed-parameter tractability and completeness I: Basic results, SIAM Journal on Computing 24, pp. 873-921, (1995).
16. R. G. DOWNEY AND M. R. FELLOWS, Parameterized Complexity, Monographs in Computer Science, Springer, New York, (1999).
17. R. G. DOWNEY, V. ESTIVILL-CASTRO, M. R. FELLOWS, E. PRIETO, AND F. A. ROSAMOND, Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems, Electr. Notes Theor. Comput. Sci. 78, (2003).
18. U. FEIGE AND J. KILIAN, On limited versus polynomial nondeterminism, CJTCS: Chicago Journal of Theoretical Computer Science, (1997).
19. M. R. FELLOWS, Personal communications, (1999), (2005).
20. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman and Company, San Francisco, (1979).
21. D. HOCHBAUM, Approximation Algorithms for NP-hard Problems, PWS Publishing, (1997).
22. V. KANN, On the Approximability of NP-complete Optimization Problems, PhD thesis, Royal Institute of Technology, Sweden, (1992).
23. N. KARMARKAR AND R. M. KARP, An efficient approximation scheme for the one-dimensional bin packing problem, Proc. of FOCS, pp. 312-320, (1982).
24. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, Journal Of Computer and System Sciences 43, pp. 425-440, (1991).
25. C. SCHNORR, Optimal algorithms for self-reducible problems, Proc. of ICALP, pp. 322-337, (1976).
26. D. SIMCHI-LEVI, New worst-case results for the bin-packing problem, Naval Research Logistics 41, pp. 579-585, (1994).