The 2-quasi-greedy algorithm for cardinality constrained matroid bases
From MaRDI portal
Publication:1079134
DOI10.1016/0166-218X(86)90088-0zbMath0596.90094MaRDI QIDQ1079134
Publication date: 1986
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C10: Integer programming
68R10: Graph theory (including graph drawing) in computer science
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
