Coordinatized kernels and catalytic reductions: An improved FPT algorithm for max leaf spanning tree and other problems

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

Volumn 1974, Issue , 2000, Pages 240-251

  Fellows, Michael R ^a   McCartin, Catherine ^a   Rosamond, Frances A ^a   Stege, Ulrike ^b  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING; TREES (MATHEMATICS);

CATALYTIC REDUCTION; DOMINATING SETS; EDGE DOMINATING SET; FEEDBACK VERTEX SET; FPT ALGORITHMS; GENERAL METHOD; SPANNING TREE; SPANNING TREE PROBLEMS;

ALGORITHMS;

EID: 84947709605     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (23)

1. H.L. Bodlaender. “On linear time minor tests and depth-first search.” In F.De hne et al. (eds.), Proc. First Workshop on Algorithms and Data Structures, LNCS 382, pp.577–590, 1989.
2. R. Balasubramanian, M. R.F ellows, and V. Raman. “A n Improved Fixed-Parameter Algorithm for Vertex Cover.” Information Processing Letters65:3, pp.163–168, 1998.
3. B. Berger, T. Leighton. ”Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete.” In S.Is trail, P.P evzner, and M.W aterman (eds.), Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB98), pp.30–39, 1998.
4. L. Cai, J. Chen, R. Downey, and M. Fellows. “The parameterized complexity of short computation and factorization.” Archive for Mathematical Logic36, pp.321–338, 1997.
5. P. Crescen zi, D. Gold man, C. Papadimitriou, A. Piccolb oni and M. Yannakakis.“ On the complexity of protein folding.” In S.Is trail, P.P evzner, and M.W aterman (eds.), Proceedings of the Second Annual International Conference on Computational Molecular Biology (RECOMB98), 1998.
6. J. Chen, I. Kanj, and W. Jia. “Vertex cover: Further Observations and Further Improvements.” 25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG’99) Ascona, Switzerland, June 1999.
7. R.D owney and M.F ellows. “Parameterized Computational Feasibility.” P. Clote, J. Remmel (eds.): Feasible Mathematics IIBoston: Birkhauser, pp.219–244, 1995.
8. R. Downey and M. Fellows. “Fix ed-parameter tractability and completeness II: completeness for W[1].” Theoretical Computer Science A141, pp.109–131, 1995.
9. R.D owney and M. Fellows. Parameterized Complexity. Springer-Verlag, 1998.
10. R.D owney, M. Fellows, and U.S tege. “Parameterized complexity: a framework for systematically confronting computational intractability.” In: Contemporary Trends in Discrete Mathematics (R. Grah am, J.Kratochvil, J. Nesetril and F.R oberts, eds.), AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 49, pp.49–99, 1999.
11. E. Dijkstra. “Self-Stabilizing Systems in Spite of Distributed Control.” Communications of the ACM17, pp.643–644, 1974.
12. M. Fellows and M. Langston. “On Well-Partial-Order Theory and Its Applications to Combinatorial Problems of VLSI Design.” Technical Report CS-88-188, Department of Computer Science, Washington State University, 1988.
13. M. Fellows, C. McCartin, F. Rosamond, and U. Stege.” The parametric dual of Dominating Set is fixed-parameter tractable,” 2000.
14. G. Galbiati, F. Maffioli, and A. Morzenti. “A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem.” Information Processing Letters52, pp.45–49, 1994.
15. G. Galbiati, A. Morzenti and F. Maffioli. “On the Approximability of some Maximum Spanning Tree Problems.” Theoretical Computer Science181, pp.107–118, 1997.
16. M.G arey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, 1979.
17. T. Haynes, S. Hedetniemi, and P. Slater. Fundamentals of Domination in Graphs. Marcel Dekker, Inc, 1998.
18. E. Kranakis, D. Krizanc, B. Ruf, J. Urrutia, G. Woeginger. “VCdimensions for graphs.” In M. Nagl, editor, Graph-theoretic concepts in computer science, LNCS 1017, pp.1–13, 1995.
19. H.-I. Lu and R. Ravi. “A pproximating Maximum Leaf Spanning Trees in Almost Linear Time.” Journal of Algorithms29, pp.132–141, 1998.
20. R.Ni edermeier and P. Rossmanith. “Upper Bounds for Vertex Cover Further Improved.” In C. Meinel and S. Tison, editors, Proceedings of the 16th Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pp.561–570, 1999.
21. R.N iedermeier and P.R ossmanith. “A General Method to Speed Up Fixed-Parameter-Tractable Algorithms.” Information Processing Letters, 73, pp.125–129, 2000.
22. R.N iedermeier and P. Rossmanith. “A n efficient fixed parameter algorithm for 3-Hitting Set.” accepted for publication in Journal of Discrete Algorithms, August 2000.
23. U. Stege. Resolving Conflicts from Computational Biology. Ph.D. thesis, Department of Computer Science, ETH Zürich, Switzerland, 1999.