A framework for the greedy algorithm

DOI10.1016/S0166-218X(01)00362-6zbMath1007.05038OpenAlexW2161029789MaRDI QIDQ1613405

R. Smith

Publication date: 29 August 2002

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00362-6

zbMATH Keywords

greedy algorithmmatroidCoxeter matroid

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Shadows of Newton polytopes, Monge Properties, Optimal Greedy Policies, and Policy Improvement for the Dynamic Stochastic Transportation Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symplectic matroids
• A geometric characterization of Coxeter matroids
• The greedy algorithm and Coxeter matroids
• Greedy algorithm and symmetric matroids
• Combinatorial geometries and torus strata on homogeneous compact manifolds
• Optimal assignments in an ordered set: An application of matroid theory
• Matroids and the greedy algorithm