A structural view on parameterizing problems: Distance from triviality

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

Volumn 3162, Issue , 2004, Pages 162-173

  Guo, Jiong ^a   Hüffner, Falk ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZATION;

CASE-STUDIES; COMPUTATIONAL COMPLEXITY ANALYSIS; HARD PROBLEMS; LONGEST COMMON SUBSEQUENCES; PARAMETERIZING; POWER DOMINATING SETS; SET COVER; STRUCTURAL PROBLEMS;

PARAMETER ESTIMATION;

EID: 35048844646     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_15     Document Type: Article

References (30)

1. J. Alber, H. L. Bodlaender, H. Fernau, T. Kloks, and R. Niedermeier. Fixed parameter algorithms for Dominating Set and related problems on planar graphs. Algorithmica, 33(4):461-493, 2002.
2. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege. Refined search tree technique for Dominating Set on planar graphs. In Proc. 26th MFCS, volume 2136 of LNCS, pages 111-122. Springer, 2001.
3. H. L. Bodlaender. Classes of graphs with bounded treewidth. Technical Report RUU-CS-86-22, Dept. of Computer Sci., Utrecht University, 1986.
4. H. L. Bodlaender. Treewidth: Algorithmic techniques and results. In Proc. 22nd MFCS, volume 1295 of LNCS, pages 19-36. Springer, 1997.
5. H. L. Bodlaender, R. G. Downey, M. R. Fellows, and H. T. Wareham. The parameterized complexity of the longest common subsequence problem. Theoretical Computer Science, 147:31-54, 1995.
6. L. Cai. Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters, 58:171-176, 1996.
7. L. Cai. Parameterized complexity of Vertex Colouring. Discrete Applied Mathematics, 127(l):415-429, 2003.
8. J. Chen, I. A. Kanj, and W. Jia. Vertex Cover: Further observations and further improvements. J. Algorithms, 41:280-301, 2001.
9. E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos. Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs. In Proc. 15th SODA, pages 830-839. SIAM, 2004.
10. R. G. Downey. Parameterized complexity for the skeptic. In Proc. 18th IEEE Annual Conference on Computational Complexity, pages 147-169, 2003.
11. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
12. J. Ellis, H. Fan, and M. R. Fellows. The Dominating Set problem is fixed parameter tractable for graphs of bounded genus. In Proc. 8th SWAT, volume 2368 of LNCS, pages 180-189. Springer, 2002.
13. M. R. Fellows. Blow-ups, win/win's, and crown rules: Some new directions in FPT. In Proc. 29th WG, volume 2880 of LNCS, pages 1-12. Springer, 2003.
14. M. R. Fellows. New directions and new challenges in algorithm design and complexity, parameterized. In Proc. 8th WADS, volume 2748 of LNCS, pages 505-520. Springer, 2003.
15. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Graph-modeled data clustering: Fixed-parameter algorithms for clique generation. In Proc. 5th CIAC, volume 2653 of LNCS, pages 108-119. Springer, 2003. To appear in Theory of Computing Systems.
16. J. Gramm, J. Guo, F. Hüffner, and R. Niedermeier. Automated generation of search tree algorithms for hard graph modification problems. Algorithmica, 39(4):321-347, 2004.
17. J. Guo and R. Niedermeier. Exact algorithms and applications for Tree-like Weighted Set Cover. Manuscript, June 2004.
18. T. W. Haynes, S. M. Hedetniemi, S. T. Hedetniemi, and M. A. Henning. Domination in graphs applied to electric power networks. SIAM J. Discrete Math., 15(4):519-529, 2002.
19. M. Hoffmann and Y. Okamoto. The traveling salesman problem with few inner points. In Proc. 10th COCOON, volume 3106 of LNCS. Springer, 2004.
20. 2) steps. In Proc. 30th WG, LNCS. Springer, 2004. To appear.
21. R. Niedermeier. Ubiquitous parameterization-invitation to fixed-parameter algorithms. In Proc. 29th MFCS, LNCS. Springer, 2004. To appear.
22. R. Niedermeier and P. Rossmanith. On efficient fixed-parameter algorithms for Weighted Vertex Cover. J. Algorithms, 47(2):63-77, 2003.
23. N. Nishimura, P. Ragde, and D. M. Thilikos. Fast fixed-parameter tractable algorithms for nontrivial generalizations of Vertex Cover. In Proc. 7th WADS, volume 2125 of LNCS, pages 75-86. Springer, 2001. To appear in Discrete Applied Mathematics.
24. C. H. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci., 43:425-440, 1991.
25. K. Pietrzak. On the parameterized complexity of the fixed alphabet Shortest Common Supersequence and Longest Common Subsequence problems. J. Comput. Syst. Sci., 67(4):757-771, 2003.
26. N. Robertson and P. D. Seymour. Graph minors. II: Algorithmic aspects of treewidth. J. Algorithms, 7:309-322, 1986.
27. J. M. Robson. Algorithms for maximum independent sets. J. Algorithms, 7:425-440, 1986.
28. S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. In Proc. 9th COCOON, volume 2697 of LNCS, pages 548-558. Springer, 2003.
29. R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13(3):566-579, 1984.
30. J. A. Telle and A. Proskurowski. Practical algorithms on partial fc-trees with an application to domination-like problems. In Proc. 3rd WADS, volume 709 of LNCS, pages 610-621. Springer, 1993.