Tight lower bounds for certain parameterized NP-hard problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn 19, Issue , 2004, Pages 150-160

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

^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)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; GRAPH THEORY; HIERARCHICAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

DOMINATING SET; HITTING SET; INDEPENDENT SET; WEIGHTED SET;

SET THEORY;

EID: 4544318827     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

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:235-276, 1995.
2. J. Buhler and M. Tompa. Finding motifs using random projections. Journal of Computational Biology, 9:225-242, 2002.
3. L. Cai and D. Juedes. On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences, 67(4):789-807, 2003.
4. J. Cheetham, F. Dehne, A. Rau-Chaplin, U. Stege, and P.Taillom. Solving large FPT problems on coarse grained parallel machines. Journal of Computer and System Sciences, 67(4):691-706, 2003.
5. J. Chen. Characterizing parallel hierarchies by reducibilities. Information Processing Letters, 39:303-307, 1991.
6. J. Chen, I. Kanj, and W. Jia. Vertex cover: further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
7. D. Coppersmith, and S. Winograd. Matrix multiplication via arithmetic progression. Journal of Symbolic Computation, 9:251-280, 1990.
8. C. Cotta and P. Moscato. The k-feature set problem is W[2]-compIete. Journal of Computer and System Sciences, 67(4):686-690, 2003.
9. 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:205-218, 2003.
10. R. Downey and M. Fellows. Parameterized Complexity. Springer, New York, 1999.
11. U. Feige and J. Kilian. On limited versus polynomial nondeterminism. Chicago Journal of Theoretical Computer Science, 1997.
12. K. V. Horn and T. Martinez. The minimum feature set problem. Neural Networks, 7(3):491-494, 1994.
13. R. Impagliazzo and R. Paturi. Which problems have strongly exponential complexity? Journal of Computer and System Sciences, 63:512-530, 2001.
14. G. Nemhauser and L. Trotter. Vertex packing: structural properties and algorithms. Mathematical Programming, 8:232-248, 1975.
15. J. Nešetřil and S. Poljak. On the complexity of the subgraph problem. Commentationes Mathematicae Universitatis Carolinae, 26(2):415-419, 1985.
16. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
17. C. Papadimitriou and M. Yannakakis. On limited non-determinism and the complexity of the V-C dimension. Journal of Computer and System Sciences, 53:161-170, 1996.
18. P. Pevzner and S. Sze. Combinatorial approaches to finding subtle signals in DNA sequences. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 269-278, 2000.
19. C. Roth-Korostensky. Algorithms for Building Multiple Sequence Alignments and Evolutionary Trees. PhD thesis, 13550, ETH Zürich, 2000.
20. U. Stege. Resolving Conflicts from Problems in Computational Biology. PhD thesis, 13364, ETH Zürich, 2000.
21. G. Woeginger. Exact algorithms for NP-hard problems: a survey. In Combinatorial Optimization - Eureka! You shrink!, volume 2570 of Lecture Notes in Computer Science, pages 185-207, 2003.