Pages that link to "Item:Q1140103"
From MaRDI portal
The following pages link to The greedy algorithm for partially ordered sets (Q1140103):
Displaying 18 items.
- Greedy algorithms and poset matroids (Q473210) (← links)
- Structural properties of greedoids (Q594882) (← links)
- Poset matching---a distributive analog of independent matching (Q685701) (← links)
- Optimal matchings in posets (Q792355) (← links)
- A unifying approach to the structures of the stable matching problems (Q808729) (← links)
- Note on pseudolattices, lattices and submodular linear programs (Q951121) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- A general model for matroids and the greedy algorithm (Q1013980) (← links)
- Selectors: a theory of formal languages, semimodular lattices, and branching and shelling processes (Q1069309) (← links)
- Greedoid polyhedra (Q1097283) (← links)
- An analysis of the greedy algorithm for partially ordered sets (Q1161533) (← links)
- Optimization problems with color-induced budget constraints (Q1631646) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- The intersection of matroids and antimatroids (Q2277465) (← links)
- An algorithmic characterization of antimatroids (Q2640448) (← links)
- Optimization Problems with Color-Induced Budget Constraints (Q2835676) (← links)
- Greedoids and Linear Objective Functions (Q3323971) (← links)
- On the subdifferential of a submodular function (Q3332786) (← links)
