Abstract
A forest cover of a graph is a spanning forest for which each component has at least two nodes. IfK is a subset of nodes, aK-forest cover is a forest cover including exactly one node fromK in each component. We show that the weighted two matroid intersection algorithm determines the maximum costK-forest cover.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.O. Cerdeira and C.J. Luz, “Covering nodes with a fixed number of trees,” Technical report, Nota no. 3/85, Centro de Estatística e Aplicações, Lisboa/I.N.I.C.
J. Edmonds, “Matroid intersection,”Annals of Discrete Mathematics 4 (1979) 39–49.
A.B. Gamble and W.R. Pulleyblank, “Forest covers and a polyhedral intersection theorem,”Mathematical Programming 45 (1989) 49–58.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Rinehart and Winston, New York, 1976).
L.J. White, “Minimum covers of fixed cardinality in weighted graphs,”SIAM Journal of Applied Mathematics 21 (1971) 104–113.
Author information
Authors and Affiliations
Additional information
Centro de Matemática e Aplicações Fundamentais (Projecto 6F91).