The greedy algorithm for partially ordered sets
From MaRDI portal
Publication:1140103
DOI10.1016/0012-365X(79)90092-XzbMath0435.06003MaRDI QIDQ1140103
Publication date: 1979
Published in: Discrete Mathematics (Search for Journal in Brave)
Partial orders, general (06A06) Extremal problems in graph theory (05C35) Software, source code, etc. for problems pertaining to ordered structures (06-04)
Related Items (19)
Greedy Families for Linear Objective Functions ⋮ Optimization problems with color-induced budget constraints ⋮ Greedoid polyhedra ⋮ An algorithmic characterization of antimatroids ⋮ Structural properties of greedoids ⋮ A new greedy algorithm for the quadratic assignment problem ⋮ An analysis of the greedy algorithm for partially ordered sets ⋮ Greedy algorithms and poset matroids ⋮ Note on pseudolattices, lattices and submodular linear programs ⋮ Poset matching---a distributive analog of independent matching ⋮ Greedoids and Linear Objective Functions ⋮ On the subdifferential of a submodular function ⋮ The intersection of matroids and antimatroids ⋮ Minimum partition of an independence system into independent sets ⋮ A general model for matroids and the greedy algorithm ⋮ Optimization Problems with Color-Induced Budget Constraints ⋮ Optimal matchings in posets ⋮ A unifying approach to the structures of the stable matching problems ⋮ Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Geometries on partially ordered sets
- Note on Independence Functions
- A greedy algorithm for solving a certain class of linear programmes
- Optimal assignments in an ordered set: An application of matroid theory
- Ordered structures and partitions
- Matroids and the greedy algorithm
This page was built for publication: The greedy algorithm for partially ordered sets
