Pages that link to "Item:Q1102299"
From MaRDI portal
The following pages link to A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299):
Displaying 9 items.
- Phylogenetic diversity and the maximum coverage problem (Q735104) (← links)
- Valuated matroids: A new look at the greedy algorithm (Q913805) (← links)
- A greedy-algorithm characterization of valuated \(\Delta\)-matroids (Q1190645) (← links)
- Greedy algorithm compatibility and heavy-set structures (Q1193543) (← links)
- Hereditary systems and greedy-type algorithms. (Q1414589) (← links)
- Critical sets, crowns and local maximum independent sets (Q2149605) (← links)
- Optimizing phylogenetic diversity under constraints (Q2210035) (← links)
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm (Q2312659) (← links)
- A greedy algorithm for maximizing a linear objective function (Q2773612) (← links)
