Please use this identifier to cite or link to this item:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/353464
Type: | Artigo |
Title: | A 3-approximation algorithm for the maximum leaf k-forest problem |
Author: | Reis, M. F. San Felice, M. C. Lee, O 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 Otimização combinatória Approximation algorithms Graph algorithms Combinatorial optimization |
Country: | Holanda |
Editor: | Elsevier |
Rights: | fechado |
Identifier DOI: | 10.1016/j.endm.2017.10.035 |
Address: | https://www.sciencedirect.com/science/article/pii/S1571065317302743 |
Date Issue: | 2017 |
Appears in Collections: | IC - Artigos e Outros Documentos |
Files in This Item:
File | Size | Format | |
---|---|---|---|
2-s2.0-85032453064.pdf | 254.64 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.