Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve Kernel(s) for problems with no kernel, on out-trees with many leaves. (English) Zbl 1295.68120 ACM Trans. Algorithms 8, No. 4, Paper No. 38, 19 p. (2012). Cited in 18 Documents MSC: 68Q17 Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) 05C05 Trees 05C85 Graph algorithms (graph-theoretic aspects) 68W25 Approximation algorithms Keywords:kernelization; lower bounds; max-leaf spanning tree; out-branching; parameterized algorithms PDF BibTeX XML Cite \textit{D. Binkele-Raible} et al., ACM Trans. Algorithms 8, No. 4, Paper No. 38, 19 p. (2012; Zbl 1295.68120) Full Text: DOI