scientific article; zbMATH DE number 169611
From MaRDI portal
Publication:4038320
Recommendations
Cited in
(22)- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions
- Greedy algorithm compatibility and heavy-set structures
- Hereditary systems and greedy-type algorithms.
- The greedy algorithm and Coxeter matroids
- A greedy algorithm for interval greedoids
- Greedy algorithm with gaps
- A disturbed version of the greedy algorithm
- When the greedy algorithm fails
- Matroidal approximations of independence systems
- A generalization of the notion of the rank function of a matroid
- A greedy algorithm for maximizing a linear objective function
- Neighbor systems and the greedy algorithm
- Problems on independence systems solvable by the greedy algorithm
- scientific article; zbMATH DE number 20942 (Why is no real title available?)
- scientific article; zbMATH DE number 2165210 (Why is no real title available?)
- An Exact Characterization of Greedy Structures
- On the generality of the greedy algorithm for solving matroid base problems
- Greedy in Approximation Algorithms
- The greedy algorithm as a combinatorial principle
- Matroids And Greedy Algorithms. A Deeper Justification of Using Greedy Approach To Find A Maximal set of a Matroid
- Weakly greedy algorithm and pair-Delta-matroids
- On performance of greedy algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4038320)
