Fuzzy matroids and a greedy algorithm (Q1814028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5654
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fuzzy matroids and a greedy algorithm |
scientific article; zbMATH DE number 5654 |
Statements
Fuzzy matroids and a greedy algorithm (English)
0 references
25 June 1992
0 references
A greedy algorithm for fuzzy matroids is developed. Eight definitions establish the main properties (hereditary and exchange) and some key concepts (rank function, independence, fundamental sequence, \(r\)-level matroid, etc.) for crisp and fuzzy matroids. An example illustrates the roles of them. The main results are fixed in two theorems and a lemma. The proposed greedy algorithm is effective under certain hypothesis. A basis of a matroid can be obtained for a weight function and a fuzzy set. The algorithm is briefly described as the ``greediest of the greedy algorithms with respect to degree membership''.
0 references
greedy algorithm
0 references
fuzzy matroids
0 references
basis of a matroid
0 references
0.9193372130393982
0 references
0.886383056640625
0 references
0.8284805417060852
0 references
0.8184573650360107
0 references
0.815862774848938
0 references
