An analysis of the greedy algorithm for partially ordered sets (Q1161533): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On approximate algorithms for combinatorial linear maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The greedy algorithm for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of greedy type algorithms for independence systems / rank
 
Normal rank

Latest revision as of 15:03, 13 June 2024

scientific article
Language Label Description Also known as
English
An analysis of the greedy algorithm for partially ordered sets
scientific article

    Statements

    An analysis of the greedy algorithm for partially ordered sets (English)
    0 references
    0 references
    1982
    0 references
    0 references
    finite partially ordered set
    0 references
    free monoid
    0 references
    independence system
    0 references
    natural weighting
    0 references
    greedy algorithm
    0 references
    greedy solution
    0 references