There is no asymptotic PTAS for two-dimensional vector packing (Q293152): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590650 / rank
 
Normal rank
Property / zbMATH Keywords
 
analysis of algorithms
Property / zbMATH Keywords: analysis of algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
worst-case analysis
Property / zbMATH Keywords: worst-case analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation scheme
Property / zbMATH Keywords: approximation scheme / rank
 
Normal rank
Property / zbMATH Keywords
 
vector packing
Property / zbMATH Keywords: vector packing / rank
 
Normal rank
Property / zbMATH Keywords
 
bin packing
Property / zbMATH Keywords: bin packing / rank
 
Normal rank

Revision as of 20:15, 27 June 2023

scientific article
Language Label Description Also known as
English
There is no asymptotic PTAS for two-dimensional vector packing
scientific article

    Statements

    There is no asymptotic PTAS for two-dimensional vector packing (English)
    0 references
    9 June 2016
    0 references
    analysis of algorithms
    0 references
    combinatorial problems
    0 references
    worst-case analysis
    0 references
    approximation scheme
    0 references
    vector packing
    0 references
    bin packing
    0 references

    Identifiers