A disturbed version of the greedy algorithm
From MaRDI portal
Recommendations
Cites work
- Greedoids
- Greedy algorithm and symmetric matroids
- Note on Independence Functions
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal assignments in an ordered set: An application of matroid theory
- Valuated matroids: A new look at the greedy algorithm
- Well-layered maps and the maximum-degree k k-subdeterminant of a matrix of rational functions
This page was built for publication: A disturbed version of the greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1808486)