Spanning trees with many leaves
SIAM Journal on Discrete Mathematics
Weighted NP Optimization Problems: Logical Definability and Approximation Properties
SIAM Journal on Computing
On weighted vs unweighted versions of combinatorial optimizationproblems
Information and Computation
A 2-approximation algorithm for the minimum weight edge dominating set problem
Discrete Applied Mathematics
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Invitation to data reduction and problem kernelization
ACM SIGACT News
A New Algorithm for Finding Trees with Many Leaves
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Kernelization: New Upper and Lower Bound Techniques
Parameterized and Exact Computation
On Finding Directed Trees with Many Leaves
Parameterized and Exact Computation
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Parameterized and Exact Computation
An Amortized Search Tree Analysis for k-Leaf Spanning Tree
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Spanning trees with many leaves in graphs without diamonds and blossoms
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Simpler linear-time kernelization for planar dominating set
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
European Journal of Combinatorics
Hi-index | 0.00 |
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected connected graph G=(V,E), a rational number k≥1 and a weight function $w: V \longmapsto Q_{\geq 1}$ on the vertices, and are asked whether a spanning tree T for G exists such that the combined weight of the leaves of T is at least k. We show that it is possible to transform an instance 〈G,w, k 〉 of Weighted Max Leaf in linear time into an equivalent instance 〈G′,w′, k′ 〉 such that |V′|≤5.5k′ and k′≤k. In the context of fixed parameter complexity this means that Weighted Max Leaf admits a kernel with 5.5k vertices. The analysis of the kernel size is based on a new extremal result which shows that every graph G that excludes some simple substructures always contains a spanning tree with at least |V|/5.5 leaves.