
doi: 10.1007/bf02193032
In the vein of Rado's beautiful characterization of matroids by the functioning of the Greedy Algorithm we prove that our persistent frustrations in obtaining analogues and generalizations of Shapiro's Lemma had a good reason.
greedy algorithm, 510.mathematics, Combinatorial aspects of matroids and geometric lattices, Combinatorial inequalities, Article
greedy algorithm, 510.mathematics, Combinatorial aspects of matroids and geometric lattices, Combinatorial inequalities, Article
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
