Tight lower bounds for certain parameterized NP-hard problems

Information and Computation

Volumn 201, Issue 2, 2005, Pages 216-231

  Chen, Jianer ^a   Chor, Benny ^b   Fellows, Mike ^c   Huang, Xiuzhen ^a   Juedes, David ^d   Kanj, Iyad A ^e   Xia, Ge ^a,f  

^a TEXAS A AND M UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c UNIVERSITY OF NEWCASTLE   (Australia)

^d OHIO UNIVERSITY   (United States)

^e DEPAUL UNIVERSITY   (United States)

^f LAFAYETTE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NETWORKS (CIRCUITS); PROBLEM SOLVING; SET THEORY;

DEPTH-T CIRCUITS; FPT; PARAMETERIZED PROBLEMS;

COMPUTATIONAL COMPLEXITY;

EID: 24144439137     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2005.05.001     Document Type: Article

References (24)

1. K.A. Abrahamson, R.G. Downey, and M.R. Fellows Fixed-parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs Annals of Pure and Applied Logic 73 1995 235 276
2. J. Buhler, and M. Tompa Finding motifs using random projections Journal of Computational Biology 9 2002 225 242
3. L. Cai, and D. Juedes On the existence of subexponential parameterized algorithms Journal of Computer and System Sciences 67 4 2003 789 807
4. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, and P. Taillon Solving large FPT problems on coarse grained parallel machines Journal of Computer and System Sciences 67 4 2003 691 706
5. J. Chen Characterizing parallel hierarchies by reducibilities Information Processing Letters 39 1991 303 307
6. J. Chen, X. Huang, I.A. Kanj, G. Xia, W-hardness under linear FPT-reductions: structural properties and further application, in: Proceedings of the Eleventh International Computing and Combinatorics Conference (COCOON'05), Kunming, Yunnan, PRC, August 16-19, 2005 (to appear).
7. J. Chen, I.A. Kanj, and W. Jia Vertex cover: further observations and further improvements Journal of Algorithms 41 2001 280 301
8. D. Coppersmith, and S. Winograd Matrix multiplication via arithmetic progression Journal of Symbolic Computation 9 1990 251 280
9. C. Cotta, and P. Moscato The k-feature set problem is W[2]-complete Journal of Computer and System Sciences 67 4 2003 686 690
10. R. Downey, V. Estivill-Castro, M. Fellows, E. Prieto-Rodriguez, and F. Rosamond Cutting up is hard to do: the parameterized complexity of k-cut and related problems Electronic Notes in Theoretical Computer Science 78 2003 205 218
11. R.G. Downey, and M.R. Fellows Parameterized complexity 1999 Springer Berlin
12. U. Feige, and J. Kilian On limited versus polynomial nondeterminism Chicago Journal of Theoretical Computer Science 1997
13. O. Goldschmidt, D. Hochbaum, Polynomial algorithm for k-cut problem, in: Proceedings of the 29th Annual Symposium on the Foundations of Computer Science (FOCS 1988), 1998, pp. 444-451
14. O. Goldschmidt, and D. Hochbaum A polynomial algorithm for k-cut problem for fixed k Mathematics of Operations Research 19 1994 24 37
15. R. Impagliazzo, and R. Paturi Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63 2001 512 530
16. G.L. Nemhauser, and L.E. Trotter Vertex packing: structural properties and algorithms Mathematical Programming 8 1975 232 248
17. J. Nešetřil, and S. Poljak On the complexity of the subgraph problem Commentationes Mathematicae Universitatis Carolinae 26 2 1985 415 419
18. C.H. Papadimitriou, and M. Yannakakis Optimization, approximation, and complexity classes Journal of Computer and System Sciences 43 1991 425 440
19. C.H. Papadimitriou, and M. Yannakakis On limited nondeterminism and the complexity of VC dimension Journal of Computer and System Sciences 53 1996 161 170
20. P.A. Pevzner, S.-H. Sze, Combinatorial approaches to finding subtle signals in DNA sequences, in: Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 269-278.
21. C. Roth-Korostensky, Algorithms for Building Multiple Sequence Alignments and Evolutionary Trees, Ph.D. Thesis, No. 13550, ETH Zürich, 2000.
22. U. Stege, Resolving Conflicts from Problems in Computational Biology, Ph.D. Thesis, No. 13364, ETH Zürich, 2000.
23. K. Van Horn, and T. Martinez The minimum feature set problem Neural Networks 7 3 1994 491 494
24. G.J. Woeginger, Exact algorithms for NP-hard problems: a survey, in: Lecture Notes in Computer Science, vol. 2570, Springer, Berlin, 2003, pp. 185-207.