On ordered languages and the optimization of linear functions by greedy algorithms

DOI10.1145/4221.4998zbMath0633.68016OpenAlexW2019474950MaRDI QIDQ3771598

Ulrich Faigle

Publication date: 1985

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/4221.4998

zbMATH Keywords

optimizationlinear programminggreedy algorithmordered matroidrank functionhereditary languageCoxeteroidsintegral polymatroidlinear functions on finite languagesordered languagespolygreedoids

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of matroids and geometric lattices (05B35) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Related Items (3)

An algorithmic characterization of antimatroids ⋮ Greedy algorithms and poset matroids ⋮ A general model for matroids and the greedy algorithm

This page was built for publication: On ordered languages and the optimization of linear functions by greedy algorithms