Matroids and a forest cover problem

DOI10.1007/BF01581157MaRDI QIDQ1337143zbMATH OpenOpenAlexFDO

Authors Jorge Orestes Cerdeira

Publication date 30 October 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01581157

zbMATH Keywords

forest cover of a graphspanning forestweighted two matroid intersection algorithm

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 949664
• On matroids and hierarchical graphs
• Forest covers and a polyhedral intersection theorem
• A greedy heuristic for a minimum-weight forest problem
• Fractional covers for forests and matchings

Cites work

• Forest covers and a polyhedral intersection theorem
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3918119 (Why is no real title available?)
• Matroid Intersection
• Minimum Covers of Fixed Cardinality in Weighted Graphs

Cited in

(9)

• Forest covers and a polyhedral intersection theorem
• \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem
• Fractional covers for forests and matchings
• Covering a tree by a forest
• scientific article; zbMATH DE number 123817 (Why is no real title available?)
• Stochastic maximum weight forest problem
• An approximation algorithm for the three depots Hamiltonian path problem
• scientific article; zbMATH DE number 949664 (Why is no real title available?)
• Approximation algorithms for multiple terminal, Hamiltonian path problems

This page was built for publication: Matroids and a forest cover problem

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