Matroids and a forest cover problem

DOI10.1007/BF01581157zbMath0811.90109OpenAlexW2151820271MaRDI QIDQ1337143

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

spanning forestforest cover of a graphweighted two matroid intersection algorithm

Mathematics Subject Classification ID

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

Related Items

An Approximation Algorithm for the Three Depots Hamiltonian Path Problem, Approximation algorithms for multiple terminal, Hamiltonian path problems, \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem

Cites Work

• Unnamed Item
• Unnamed Item
• Forest covers and a polyhedral intersection theorem
• Matroid Intersection
• Minimum Covers of Fixed Cardinality in Weighted Graphs