Bin packing can be solved within 1+epsilon in linear time (Q1164429): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: W. Fernandez de la Vega / rank
 
Normal rank
Property / author
 
Property / author: George S. Lueker / rank
 
Normal rank

Revision as of 10:02, 11 February 2024

scientific article
Language Label Description Also known as
English
Bin packing can be solved within 1+epsilon in linear time
scientific article

    Statements

    Bin packing can be solved within 1+epsilon in linear time (English)
    0 references
    1981
    0 references
    0 references

    Identifiers

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