A disturbed version of the greedy algorithm

DOI10.1016/S0893-9659(99)00029-4zbMATH Open0944.90069OpenAlexW2040166913MaRDI QIDQ1808486FDOQ1808486

Authors: Walter Wenzel 

Publication date: 9 April 2000

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(99)00029-4

Recommendations

• A framework for the greedy algorithm
• Valuated matroids -- a new look at the greedy algorithm
• scientific article

zbMATH Keywords

stabilitygreedy algorithmmatroidsdiscrete optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Greedy algorithm and symmetric matroids
• Optimal assignments in an ordered set: An application of matroid theory
• Valuated matroids: A new look at the greedy algorithm
• Greedoids
• Note on Independence Functions
• Well-layered maps and the maximum-degree \(k \times 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)