Linear FPT reductions and computational lower bounds

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 212-221

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

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

Complexity theory; Lower bound; NP hard problems

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FUNCTION EVALUATION; GRAPH THEORY; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; COMPLEXITY THEORY; LOWER BOUND; RUNNING TIME;

COMPUTATIONAL COMPLEXITY;

EID: 4544225528     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007391     Document Type: Conference Paper

References (27)

1. K. A. ABRAHAMSON, R. G. DOWXEY, 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, pp. 235-276, (1995).
2. J. ALBER, H. L. BODLAENDER, H. FERNAU, T. KLOKS, R. NIEDERMEIER, Fixed parameter algorithms for dominating set and related problems on planar graphs, Algorithmica 33, pp. 461-493, (2002).
3. G. AUSIELLO, P. CRESCENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Complexity and Approximation - Combinatorial Optimization problems and their Approximability Properties, Springer, 1999.
4. R. BEIGEL, Finding maximum independent sets in sparse and general graphs, Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA'99), pp. 856-857, (1999).
5. L. CAI AND J. CHEN, On fixed parameter tractability and approximability of NP optimization problems, Journal of Computer and System Sciences 54, pp. 465-474, (1997).
6. L. CAI AND D. JUEDES, On the existence of subexponential parameterized algorithms, Journal of Computer and System Sciences 67, pp. 789-807, (2003).
7. 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, pp. 691-701, (2003).
8. J. CHEN, Characterizing parallel hierarchy by reducibilities, Information Processing Letters 39, pp. 303-307, (1991).
9. J. CHEN, B. CHOR, M. FELLOWS, X. HUANG, D. JUEDES, I. KANJ, AND G. XIA, Tight lower bounds for parameterized NP-hard problems, Proc. 19th Annual IEEE Conference on Computational Complexity, (2004), to appear.
10. J. CHEN, X. HUANG, I. A. KANJ, AND G. XIA, Strong computational lower bounds via parameterized complexity, Tech. Report, Dept. of Computer Science, Texas A&M University (2004).
11. J. CHEN, I. A. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, Journal of Algorithms 41, pp. 280-301, (2001).
12. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progression, Journal of Symbolic Computation 9, pp. 251-280, (1990).
13. X. DENG, G. LI, Z. Li, B. MA, AND L. WANG, A PTAS for distinguishing (sub)string selection, Lecture Notes in Computer Science 2380 (ICALP'02), pp. 740-751, (2002).
14. X. DENG, G. Li, Z. Li, B. MA, AND L. WANG, Genetic design of drugs without side-effects, SIAM Journal on Computing 32, pp. 1073-1090, (2003).
15. R.G. DOWNEY AND M.R. FELLOWS, Parameterized Complexity, Springer-Verlag, 1999.
16. U. FEIGE AND J. KILIAN, On limited versus polynomial nondeterminism, Chicago Journal of Theoretical Computer Science, (1997).
17. J. GRAMM, J. GUO, AND R. NIEDERMEIER, On exact and approximation algorithms for distinguishing substring selection, Lecture Notes in Computer Science 2751 (FCT'2003), pp. 195-209, (2003).
18. R. IMPAGLIAZZO AND R. PATURI, Which problems have strongly exponential complexity? Journal of Computer and System Sciences 63, pp. 512-530, (2001).
19. 0.304n) algorithm for solving maximum independent set problem, IEEE Transactions on Computers 35, pp. 847-851, (1986).
20. J. NEŠETŘIL AND S. POLJAK, On the complexity of the subgraph problem, Commentationes Mathematicae Universitatis Carolinae 26, pp. 415-419, (1985).
21. R. NIEDERMEIER AND P. ROSSMANITH, Upper bounds for vertex cover further improved, Lecture Notes in Computer Science 1563 (STACS'99). pp. 561-570, (1999).
22. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation, and complexity classes, Journal of Computer and System Sciences 43, pp. 425-440, (1991).
23. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On limited nondeterminism and the complexity of VC dimension, Journal of Computer and System Sciences 53, pp. 161-170, (1996).
24. C. H. PAPADIMITRIOU AND M. YANNAKAKIS, On the complexity of database queries, Journal of Computer and System Sciences 58, pp. 407-427, (1999).
25. J. M. ROBSON, Algorithms for maximum independent sets. Journal of Algorithms 7, pp. 425-440, (1986).
26. n/4)? LaBRI, Universite BordeauxI, 1251-01, (2001).
27. R. E. TARJAN AND A. E. TROJANOWSKI, Finding a maximum independent set, SIAM Journal on Computing 6, pp. 537-546, (1977).