Tighter bounds on a heuristic for a partition problem (Q1350239)

From MaRDI portal
Revision as of 15:04, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Tighter bounds on a heuristic for a partition problem
scientific article

    Statements

    title
    Tighter bounds on a heuristic for a partition problem (English)
    0 references
    author
    O. Diekmann
    0 references
    publication date
    27 February 1997
    0 references
    zbMATH DE Number
    983948
    0 references
    zbMATH Keywords
    Discrete minimization
    0 references
    Partition
    0 references
    Storage allocation
    0 references
    NP-hard
    0 references
    Algorithms
    0 references
    Approximation algorithms
    0 references
    Worst-case bound
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1350239&oldid=13486610"
    Powered by MediaWiki