Fixed-Parameter Approximation: Conceptual Framework and Approximability Results

  • Liming Cai
  • Xiuzhen Huang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4169)


The notion of fixed-parameter approximation is introduced to investigate the approximability of optimization problems within the framework of fixed-parameter computation. This work partially aims at enhancing the world of fixed-parameter computation in parallel with the conventional theory of computation that includes both exact and approximate computations. In particular, it is proved that fixed-parameter approximability is closely related to the approximation of small-cost solutions in polynomial time. It is also demonstrated that many fixed-parameter intractable problems are not fixed-parameter approximable. On the other hand, fixed-parameter approximation appears to be a viable approach to solving some inapproximable yet important optimization problems. For instance, all problems in the class MAX SNP admit fixed-parameter approximation schemes in time O(2\(^{O((1-{\epsilon}/{\it O}(1)){\it k})}\) p(n)) for any small ε> 0.


Polynomial Time Minimization Problem Approximation Scheme Maximization Problem Vertex Cover 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52, 26–56 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial Optimization Problems and their Approximability Properties. Springer, Heidelberg (1999)zbMATHGoogle Scholar
  3. 3.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM 41, 153–180 (1994)zbMATHCrossRefGoogle Scholar
  4. 4.
    Bodlaender, H.: (unpublished manuscipt)Google Scholar
  5. 5.
    Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25, 1305–1317 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bodlaender, H., Fellows, M.R.: (unpublished manuscipt)Google Scholar
  7. 7.
    Cai, L., Chen, J.: On fixed-parameter tractability and approximability of NP optimization problems. J. of Comp. and Sys. Sciences 54, 465–474 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Cai, L., Chen, J.: On the amount of nondeterminism and the power of verifying. SIAM Journal of Computing 26, 733–750 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Cai, L., Chen, J., Downey, R., Fellows, M.: On the structure of parameterized problems in NP. Information and Computation 123, 38–49 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Cai, L., Juedes, D.W.: On the existence of sub-exponential time parameterized algorithms. Journal of Computer and System Sciences 67, 789–807 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Cai, L., Juedes, D., Kanj, I.: The inapproximability of non NP-hard optimization problems. Theoretical Computer Science 289, 553–571 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. Journal of Algorithms 41, 280–301 (2001)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Chen, J., Kanj, I., Xia, G.: Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems. Algorithmica 43, 245–273 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Downey, R.G., Fellows, M.R.: Fixed-parameter intractability. In: Proc. of the 7th Annual Conference on Structure in Complexity Theory, pp. 36–49 (1992)Google Scholar
  15. 15.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing 24, 873–921 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. In: Monographs in Computer Science. Springer, New York (1999)Google Scholar
  17. 17.
    Downey, R.G., Estivill-Castro, V., Fellows, M.R., Prieto, E., Rosamond, F.A.: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78 (2003)Google Scholar
  18. 18.
    Feige, U., Kilian, J.: On limited versus polynomial nondeterminism. CJTCS: Chicago Journal of Theoretical Computer Science (1997)Google Scholar
  19. 19.
    Fellows, M.R.: Personal communications (1999) (2005)Google Scholar
  20. 20.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Company, San Francisco (1979)zbMATHGoogle Scholar
  21. 21.
    Hochbaum, D.: Approximation Algorithms for NP-hard Problems. PWS Publishing (1997)Google Scholar
  22. 22.
    Kann, V.: On the Approximability of NP-complete Optimization Problems, PhD thesis, Royal Institute of Technology, Sweden (1992)Google Scholar
  23. 23.
    Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin packing problem. In: Proc. of FOCS, pp. 312–320 (1982)Google Scholar
  24. 24.
    Papadimitriou, C., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal Of Computer and System Sciences 43, 425–440 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Schnorr, C.: Optimal algorithms for self-reducible problems. In: Proc. of ICALP, pp. 322–337 (1976)Google Scholar
  26. 26.
    Simchi-Levi, D.: New worst-case results for the bin-packing problem. Naval Research Logistics 41, 579–585 (1994)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Liming Cai
    • 1
  • Xiuzhen Huang
    • 2
  1. 1.Department of Computer ScienceThe University of GeorgiaAthensUSA
  2. 2.Department of Computer ScienceArkansas State UniversityUSA

Personalised recommendations