37 search results - page 1 / 8 » An approximation algorithm for the maximum leaf spanning arb... |
TALG
2010
15 years 17 days ago
2010
117
Voted
IWPEC
2009
Springer
15 years 8 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
131
Voted
ISITA
2010
15 years 3 days ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...
125
Voted
PPSN
2010
Springer
15 years 18 days ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
129
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...