On the computational hardness based on linear FPT-reductions

Journal of Combinatorial Optimization

Volumn 11, Issue 2, 2006, Pages 231-247

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

^a TEXAS A AND M UNIVERSITY   (United States)

^b CENTRAL SOUTH UNIVERSITY   (China)

^c ARKANSAS STATE UNIVERSITY   (United States)

^d DEPAUL UNIVERSITY   (United States)

^e LAFAYETTE COLLEGE   (United States)

Author keywords

Complexity; FPT reduction; Hardness; Linear

Indexed keywords

HARDNESS; HIERARCHICAL SYSTEMS; LINEAR SYSTEMS; PROBLEM SOLVING;

COMPLEXITY; FPT-REDUCTION; LINEAR; W-HIERARCHY;

COMPUTATIONAL COMPLEXITY;

EID: 33646518351     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-006-7137-6     Document Type: Conference Paper

References (27)

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, Springer
2. Ausiello S, D'Atri A, Protasi M (1980) Structure preserving reductions among convex optimization problems, Journal of Computer and System Sciences 21:136-153
3. Bodlaender HL, Fellows MR (1995) W[2]-hardness of precedence constrained k-processor scheduling, Operations Research Letters 18, pp. 93-97
4. Cai L, Chen J (1997) On fixed parameter tractability and approximability of NP optimization problems, Journal of Computer and System Sciences 54:465-474
5. Cai L, Juedes D (2003) On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67:789-807
6. Cai L, Juedes D, Kanj IA (2002) Inapproximability of non NP-hard optimization problems, Theoretical Computer Science 289:553-571
7. Cesati M, Trevisan L (1997) On the efficiency of polynomial time approximation schemes. Information Processing Letters 64:165-171
8. Chen J ( 1991 ) Characterizing parallel hierarchy by reducibilities, Information Processing Letters 39:303-307
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-160
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-221
11. Chen J, Kanj IA, Jia W (2001) Vertex cover: further observations and further improvements, Journal of Algorithms 41:280-301
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-218
13. Downey R, Evans P, Fellows M (1993) Parameterized learning complexity, Proc. 6th ACM Workshop on Computational Learning Theory, pp. 51-57
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-244
15. Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness I: basic results, SIAM Journal on Computing 24:873-921
16. Downey RG, Fellows MR (1999) Parameterized Complexity, Springer-Verlag
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-397
18. 2 n nondeterministic bits, Proc. 31st International Colloquium on Automata, Languages, and Programming (ICALP 2004), Lecture Notes in Computer Science 3142:555-567
19. Grohe M (2001) The parameterized complexity of database queries, Proc. 20th ACM Symposium on Principles of Database Systems, (PODS'01), pp. 82-92
20. Huang X (2004) Parameterized Complexity and Polynomial-time Approximation Schemes, Ph.D. Dissertation, Department of Computer Science, Texas A&M University, December
21. Papadimitriou CH (1995) Computational Complexity. Addison-Wesley Pub., Reading, Mass
22. Papadimitriou CH, Yannakakis M (1991) Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43:425-140
23. Papadimitriou CH, Yannakakis M (1996) On limited nondeterminism and the complexity of VC dimension, Journal of Computer and System Sciences 53:161-170
24. Papadimitriou CH, Yannakakis M (1999) On the complexity of database queries, Journal of Computer and System Sciences 58:407-427
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-771
26. Tarjan RE and Trojanowski AE ( 1977) Finding a maximum independent set, SLAM J. Comput. 6:537-546
27. Van Horn K, Martinez T (1994) The minimum feature set problem, Neural Networks 7:491-494