Fuzzy matroids and a greedy algorithm
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.
- A new approach to the fuzzification of matroids
- (L,M)-fuzzy matroids
- Fuzzy matroid sums and a greedy algorithm
- Generalized matroids based on three-way decision models
- Fuzzy bases of fuzzy independent set systems
- Axioms for fuzzy bases of Hsueh fuzzy matroids
- Fuzzy greedoids
- Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids
- Bases and circuits of fuzzifying matroids
- An algorithm of the rank of a dependent fuzzy set
- Degrees of M-fuzzy families of independent L-fuzzy sets
- On the rank functions of \(\mathcal{H}\)-matroids
- A new fuzzy greedoids
- scientific article; zbMATH DE number 7071043 (Why is no real title available?)
- Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid
- Connectedness of refined Goetschel-Voxman fuzzy matroids
- Connectedness degree of G-V fuzzy matroids and its unification with fuzzifying matroids.
- Categories of (I, I)-fuzzy greedoids
- Axioms for bases of closed regular fuzzy matroids
This page was built for publication: Fuzzy matroids and a greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814028)