The greedy algorithm for partially ordered sets

DOI10.1016/0012-365X(79)90092-XMaRDI QIDQ1140103zbMATH OpenFDO

Authors U. Faigle

Publication date 1979

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(79)90092-X

zbMATH Keywords

feasible elementfinite partially-ordered setgreedy algorithmindependence systemoptimal sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to ordered structures (06-04) Partial orders, general (06A06)

Cites work

• A greedy algorithm for solving a certain class of linear programmes
• Geometries on partially ordered sets
• scientific article; zbMATH DE number 3476893 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• scientific article; zbMATH DE number 3253793 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Matroids and the greedy algorithm
• 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
• Ordered structures and partitions

Cited in

(19)

• Minimum partition of an independence system into independent sets
• A general model for matroids and the greedy algorithm
• Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
• Greedoid polyhedra
• An analysis of the greedy algorithm for partially ordered sets
• Optimization problems with color-induced budget constraints
• A new greedy algorithm for the quadratic assignment problem
• The intersection of matroids and antimatroids
• An algorithmic characterization of antimatroids
• Optimization problems with color-induced budget constraints
• Greedoids and Linear Objective Functions
• On the subdifferential of a submodular function
• Greedy Families for Linear Objective Functions
• Greedy algorithms and poset matroids
• Structural properties of greedoids
• Poset matching---a distributive analog of independent matching
• Optimal matchings in posets
• A unifying approach to the structures of the stable matching problems
• Note on pseudolattices, lattices and submodular linear programs

This page was built for publication: The greedy algorithm for partially ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1140103)