TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING

DOI10.1142/S0129054113500354zbMath1291.68431OpenAlexW1999710117MaRDI QIDQ5168419

Rolf Harren, Lars Prädel, Rob van Stee, Ulrich M. Schwarz, Klaus Jansen

Publication date: 4 July 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113500354

zbMATH Keywords

approximationbin packingrectangle packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Packing anchored rectangles ⋮ Online square-into-square packing

Cites Work

• Rectangle packing with one-dimensional resource augmentation
• Maximizing the total profit of rectangles packed into a rectangle
• Hardness of approximation for orthogonal rectangle packing and covering problems
• Approximating the advertisement placement problem
• A 3-approximation algorithm for two-dimensional bin packing
• A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
• A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• A Strip-Packing Algorithm with Absolute Performance Bound 2
• Packing d-Dimensional Bins in d Stages
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING