Greedy algorithm compatibility and heavy-set structures
From MaRDI portal
Publication:1193543
DOI10.1016/0195-6698(92)90039-3zbMath0768.05021OpenAlexW2061515687MaRDI QIDQ1193543
Victor Bryant, Peter A. Brooksbank
Publication date: 27 September 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(92)90039-3
Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Optimizing phylogenetic diversity under constraints ⋮ Phylogenetic diversity and the maximum coverage problem
Cites Work