Journal of Combinatorial Optimization

, Volume 11, Issue 2, pp 231–247 | Cite as

On the computational hardness based on linear FPT-reductions



The notion of linear fpt-reductions has been recently introduced to derive strong computational lower bounds for well-known NP-hard problems. In this paper, we formally investigate the notion of W[t]-hardness under the linear fpt-reduction, and study the structural properties of the corresponding complexity classes. Additional complexity lower bounds on important computational problems are established. Some observations on structural properties of the standard parameterized hierarchy, the W -hierarchy, are also presented.


FPT-reduction Linear Hardness Complexity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccamela A, Protasi M (1999) Complexity and Approximation – Combinatorial Optimization problems and their Approximability Properties, SpringerGoogle Scholar
  2. Ausiello S, D'Atri A, Protasi M (1980) Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences 21:136–153CrossRefMathSciNetGoogle Scholar
  3. Bodlaender HL, Fellows MR (1995) $W[2]$-hardness of precedence constrained $k$-processor scheduling, Operations Research Letters 18, pp. 93–97Google Scholar
  4. Cai L, Chen J (1997) On fixed parameter tractability and approximability of NP optimization problems, Journal of Computer and System Sciences 54:465–474CrossRefMathSciNetGoogle Scholar
  5. Cai L, Juedes D (2003) On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences 67:789–807CrossRefMathSciNetGoogle Scholar
  6. Cai L, Juedes D, Kanj IA (2002) Inapproximability of non NP-hard optimization problems, Theoretical Computer Science 289:553–571CrossRefMathSciNetGoogle Scholar
  7. Cesati M, Trevisan L (1997) On the efficiency of polynomial time approximation schemes, Information Processing Letters 64:165–171CrossRefMathSciNetGoogle Scholar
  8. Chen J (1991) Characterizing parallel hierarchy by reducibilities, Information Processing Letters 39:303–307Google Scholar
  9. Chen J, Chor B, Fellows M, Huang X, Juedes D, Kanj I, Xia G (2004) Tight lower bounds for certain parameterized NP-hard problems, Proc. 19th Annual IEEE Conference on Computational Complexity (CCC 2004), pp. 150–160Google Scholar
  10. Chen J, Huang X, Kanj I, Xia G (2004) Linear FPT reductions and computational lower bounds, Proc. 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pp. 212–221Google Scholar
  11. Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements, Journal of Algorithms 41:280–301CrossRefMathSciNetGoogle Scholar
  12. Downey R, Estivill-Castro V, Fellows M, Prieto-Rodriguez E, Rosamond F (2003) Cutting up is hard to do: the parameterized complexity of $k$-cut and related problems, Electronic Notes in Theoretical Computer Science 78:205–218Google Scholar
  13. Downey R, Evans P, Fellows M (1993) Parameterized learning complexity, Proc. 6th ACM Workshop on Computational Learning Theory, pp. 51–57Google Scholar
  14. Downey RG, Fellows MR (1994) Parameterized computational feasibility, Proc. 2nd Cornell Workshop on Feasible Mathematics, Feasible Mathematics II, Clote P, and Remmel J, eds., Birkhauser Boston,pp. 219–244Google Scholar
  15. Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness I: basic results, SIAM Journal on Computing 24:873–921CrossRefMathSciNetGoogle Scholar
  16. Downey RG, Fellows MR (1999) Parameterized Complexity, Springer-VerlagGoogle Scholar
  17. Flum J, Grohe M (2004) Model-checking problems as a basis for parameterized intractability, Proc. 19th IEEE Symposium on Logic in Computer Science, (LICS'04), pp. 388–397Google Scholar
  18. Flum J, Grohe M, Weyer M (2004) Bounded fixed-parameter tractability and log2 n nondeterministic bits, Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004), Lecture Notes in Computer Science 3142:555–567Google Scholar
  19. Grohe M (2001) The parameterized complexity of database queries, Proc. 20th ACM Symposium on Principles of Database Systems, (PODS'01), pp. 82–92Google Scholar
  20. Huang X (2004) Parameterized Complexity and Polynomial-time Approximation Schemes, Ph.D. Dissertation, Department of Computer Science, Texas A&M University, DecemberGoogle Scholar
  21. Papadimitriou CH (1995) Computational Complexity, Addison-Wesley Pub., Reading, MassGoogle Scholar
  22. Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43:425–440Google Scholar
  23. Papadimitriou CH, Yannakakis M (1996) On limited nondeterminism and the complexity of VC dimension, Journal of Computer and System Sciences 53:161–170CrossRefMathSciNetGoogle Scholar
  24. Papadimitriou CH, Yannakakis M (1999) On the complexity of database queries, Journal of Computer and System Sciences 58:407–427CrossRefMathSciNetGoogle Scholar
  25. Pietrzak K (2003) On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems, Journal of Computer and System Sciences 67:757–771CrossRefMATHMathSciNetGoogle Scholar
  26. Tarjan RE and Trojanowski AE (1977) Finding a maximum independent set, SIAM J. Comput. 6:537–546CrossRefMathSciNetGoogle Scholar
  27. Van Horn K, Martinez T (1994) The minimum feature set problem, Neural Networks 7:491–494Google Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Jianer Chen
    • 1
    • 2
  • Xiuzhen Huang
    • 3
  • Iyad A. Kanj
    • 4
  • Ge Xia
    • 5
  1. 1.Department of Computer ScienceTexas A&M UniversityCollege StationUSA
  2. 2.School of Information Science and EngineeringCentral South UniversityChangshaChina
  3. 3.Computer Science Department, Arkansas State UniversityState UniversityArkansasUSA
  4. 4.School of CTIDePaul UniversityChicagoUSA
  5. 5.Department of Computer ScienceLafayette CollegeEastonUSA

Personalised recommendations