Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves

@inproceedings{Fernau2009KernelsFP,
title={Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves},
author={H. Fernau and F. Fomin and D. Lokshtanov and Daniel Raible and S. Saurabh and Yngve Villanger},
booktitle={STACS},
year={2009}
}

The {\sc $k$-Leaf Out-Branching} problem is to find an out-branching, that is a rooted oriented spanning tree, with at least $k$ leaves in a given digraph. The problem has recently received much attention from the viewpoint of parameterized algorithms. Here, we take a kernelization based approach to the {\sc $k$-Leaf-Out-Branching} problem. We give the first polynomial kernel for {\sc Rooted $k$-Leaf-Out-Branching}, a variant of {\sc $k$-Leaf-Out-Branching} where the root of the tree searched… CONTINUE READING