On the generality of the greedy algorithm for solving matroid base problems (Q496445)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the generality of the greedy algorithm for solving matroid base problems |
scientific article; zbMATH DE number 6483964
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the generality of the greedy algorithm for solving matroid base problems |
scientific article; zbMATH DE number 6483964 |
Statements
On the generality of the greedy algorithm for solving matroid base problems (English)
0 references
21 September 2015
0 references
combinatorial optimization
0 references
matroids
0 references
universal objective function
0 references
greedy algorithm
0 references
uniform matroids
0 references
minors
0 references
transversal matroids
0 references
bipartite matchings
0 references
shortest paths
0 references
0 references
0 references
0.846398651599884
0 references
0.8463983535766602
0 references
0.8265972137451172
0 references
0.8249666690826416
0 references
