Please use this identifier to cite or link to this item:
|Title:||A 3-approximation algorithm for the maximum leaf k-forest problem|
|Author:||Reis, M. F.|
San Felice, M. C.
Usberti, F. L.
|Abstract:||In the maximum leaf spanning tree problem, we want to find a tree which spans every vertex of a graph and has as many leaves as possible. The maximum leaf k-forest problem is a generalization of that problem, in which we want a spanning forest with maximu|
|Subject:||Algoritmos de aproximação|
Algoritmos em grafos
|Appears in Collections:||IC - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.