Two for One: Tight Approximation of 2D Bin Packing (Q3183471): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q243609
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Klaus Jansen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_35 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W136402461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Packings in Two Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A algorithm for two-dimensional packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Approximability Results for 2-Dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 3-approximation algorithm for two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Rectangles into 2OPT Bins Using Rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the advertisement placement problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total profit of rectangles packed into a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Approximation Scheme for the Square Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank

Latest revision as of 01:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Two for One: Tight Approximation of 2D Bin Packing
scientific article

    Statements

    Identifiers