Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767)

From MaRDI portal
Revision as of 19:47, 9 February 2024 by RedirectionBot (talk | contribs) (‎Removed claims)
scientific article
Language Label Description Also known as
English
Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
scientific article

    Statements

    Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (English)
    0 references
    1989
    0 references
    minimax grid matching problem
    0 references
    average case analysis of algorithms
    0 references
    maximum up-right matching problem
    0 references
    upper bounds
    0 references
    dimensional bin packing
    0 references
    dimensional on-line bin packing
    0 references
    line dynamic allocation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references