A proof of the optimality of the MIN paging algorithm using linear programming duality (Q1924620)

From MaRDI portal
Revision as of 08:49, 29 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A proof of the optimality of the MIN paging algorithm using linear programming duality
scientific article

    Statements

    A proof of the optimality of the MIN paging algorithm using linear programming duality (English)
    0 references
    0 references
    0 references
    20 October 1996
    0 references
    analysis of algorithms
    0 references
    paging
    0 references
    duality
    0 references
    assignment problem
    0 references

    Identifiers