An approximation algorithm for square packing. (Q703277): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Packing Two-Dimensional Bins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing can be solved within 1+epsilon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing of squares and cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for multidimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank

Latest revision as of 17:06, 7 June 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for square packing.
scientific article

    Statements

    An approximation algorithm for square packing. (English)
    0 references
    0 references
    11 January 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Bin packing
    0 references
    Square packing
    0 references
    Approximation algorithm
    0 references
    Absolute worst-case ratio
    0 references
    0 references