Subexponential parameterized algorithms collapse the W-hierarchy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 273-284

  Cai, Liming ^a   Juedes, David ^a  

^a Ohio University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; OPTIMIZATION; PARAMETERIZATION; ALGORITHMS; COMPUTATIONAL LINGUISTICS;

BOUNDED DEGREE GRAPHS; DOMINATING SETS; EXTENDED VERSIONS; INDEPENDENT SET; OPTIMIZATION PROBLEMS; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPLEXITY; SUBEXPONENTIAL TIME;

PARAMETER ESTIMATION;

EID: 84879529072     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_23     Document Type: Conference Paper

References (18)

1. J. Alber, H. Bodlaender, H. Fernau, and R. Niedermeier. Fixed parameter algorithms for planar dominating set and related problems. In Proceedings of the 7th Scandinavian Workshop on Algorithm Theory (SWAT 2000), volume 1851 of Lecture Notes in Computer Science, pages 97-110. Springer-Verlag, 2000.
2. J. Alber, J. Gramm, and R. Niedermeier. Faster exact algorithms for hard problems: A parameterized point of view. Discrete Mathematics, 2001. to appear.
3. S. Arora and C. Lund. Hardness of approximations. In Dorit Hochbaum, editor, Approximation Algorithms for NP-hard problems, pages 399-446. PWS Publishing, 1997.
4. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41:153-180, 1994.
5. R. Balasubramanian, M. R. Fellows, and V. Raman. An improved fixed parameter algorithm for vertex cover. Information Processing Letters, 65:163-168, 1998.
6. M. Bellare and S. Goldwasser. The complexity of decision versus search. SIAM Journal on Computing, 23(1):97-119, February 1994.
7. S. Buss, 1989. Personal Communication with Downey and Fellows cited in [12, p. 5].
8. L. Cai and J. Chen. On fixed-parameter tractability and approximability of NP optimization problems. Journal of Computer and System Sciences, 54(3):465-474, June 1997.
9. J. Chen, I. A. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. In Proceedings of the 25th International Workshop on Graph-Theoretical Concepts in Computer Science, volume 1665 of Lecture Notes in Computer Science, pages 313-324. Springer-Verlag, 1999.
10. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness II: On completeness for W [1]. Theoretical Computer Science, 141:109-131, 1995.
11. R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In Proceedings of Feasible Mathematics II, pages 219-244. Birkhauser, 1995.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, New York, 1999.
13. R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In Contemporary Trends in Discrete Mathematics: From DIMACS to DIMATIA to the Future, volume 49 of AMS-DIMACS Proceeding Series, pages 49-99. AMS, 1999.
14. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco, 1979.
15. R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity In Proceedings of the 39th Symposium on Foundations of Computer Science, pages 653-664. IEEE Computer Society Press, 1998.
16. M. Mahajan and V. Raman. Parameterizing above guaranteed values:MaxSat and MaxCut. Journal of Algorithms, 31:335-354, 1999.
17. R. Niedermeier and P. Rossmanith. Upper bounds for vertex cover further improved. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, volume 1563 of Lecture Notes in Computer Science, pages 561-570. Springer-Verlag, 1999.
18. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and Systems Sciences, 43:425-440, 1991.