The greedy algorithm for partially ordered sets (Q1140103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for solving a certain class of linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometries on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal assignments in an ordered set: An application of matroid theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Independence Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered structures and partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5540285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:05, 13 June 2024

scientific article
Language Label Description Also known as
English
The greedy algorithm for partially ordered sets
scientific article

    Statements

    The greedy algorithm for partially ordered sets (English)
    0 references
    0 references
    1979
    0 references
    0 references
    0 references
    0 references
    0 references
    finite partially-ordered set
    0 references
    independence system
    0 references
    greedy algorithm
    0 references
    feasible element
    0 references
    optimal sequence
    0 references