Browsing Theses and Dissertations by Author "Pinheiro, Tiago Furtado Drehmer"
Now showing items 1-1 of 1
-
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Pinheiro, Tiago Furtado Drehmer (2022) [Dissertation]In this work, we study the k-labeled spanning forest problem (KLSF). The input of the KLSF is an undirected graph with labeled edges and a positive integer k. The goal is to find a spanning forest of the graph with at most ...