Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid (Q6135742)
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: Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid |
scientific article; zbMATH DE number 7731907
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid |
scientific article; zbMATH DE number 7731907 |
Statements
Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid (English)
0 references
26 August 2023
0 references
contraction
0 references
greedy algorithms
0 references
independence matroid
0 references
0.7334328293800354
0 references
0.7261489629745483
0 references
0.7261488437652588
0 references
0.7234445810317993
0 references
