@article {862904f1135e4a73bd12e337c3d0577a,
	title = {Matroids and a forest cover problem},
	journal = {Mathematical Programming},
	volume = {66},
	number = {3},
	year = {1994},
	note = {n/a},
	month = {jan},
	pages = {403{\textendash}405},
	publisher = {SPRINGER HEIDELBERG},
	abstract = {<p>A forest cover of a graph is a spanning forest for which each component has at least two nodes. If K is a subset of nodes, a K-forest cover is a forest cover including exactly one node from K in each component. We show that the weighted two matroid intersection algorithm determines the maximum cost K-forest cover.</p>
},
	issn = {0025-5610},
	author = {Cerdeira, {J. Orestes}}
}
