scientific article; zbMATH DE number 949664

MaRDI QIDQ4716340zbMATH OpenFDO

Authors Sjoerd M. Baas, Jorge Orestes Cerdeira

Publication date 21 April 1997

zbMATH Keywords

matchingsspanning forestforest coverminimum cost \(K\)-forest

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Matroids and a forest cover problem
• A greedy heuristic for a minimum-weight forest problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Forest covers and a polyhedral intersection theorem
• Minimum cost edge subset covering exactly \(k\) vertices of a graph

Cited in

(6)

• Minimum cost forest games
• Matroids and a forest cover problem
• scientific article; zbMATH DE number 6300221 (Why is no real title available?)
• Covering a tree by a forest
• Minimum cost edge subset covering exactly \(k\) vertices of a graph
• Forest covers and a polyhedral intersection theorem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4716340)