CORRÊA, Kennedy; 						CAMPÊLO, Manoel.
 NP-Hardness and Approximation Results for the Minimally Labeled k-Spanning Forest Problem. <em>In</em>: PROCEEDINGS OF  THE THEORY OF COMPUTATION MEETING (ETC), 10.	, 2025, Maceió/AL.
	 
	<strong>Anais</strong> [...].
 Porto Alegre: Sociedade Brasileira de Computação, 
	2025
.
 p. 65-69. 
			ISSN 2595-6116. 
		DOI: <a href="https://doi.org/10.5753/etc.2025.8860">https://doi.org/10.5753/etc.2025.8860</a>.