<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cerdeira, {J. Orestes}</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Matroids and a forest cover problem</style></title><secondary-title><style face="normal" font="default" size="100%">Mathematical Programming</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1994</style></year><pub-dates><date><style  face="normal" font="default" size="100%">jan</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">3</style></number><publisher><style face="normal" font="default" size="100%">SPRINGER HEIDELBERG</style></publisher><volume><style face="normal" font="default" size="100%">66</style></volume><pages><style face="normal" font="default" size="100%">403–405</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">n/a</style></notes></record></records></xml>