2D knapsack: packing squares
From MaRDI portal
Publication:388093
DOI10.1016/j.tcs.2012.07.035zbMath1359.90121MaRDI QIDQ388093
Xin Han, Attila Benko, Chenyang Zhou, Yan Lan, György Dósa
Publication date: 19 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.035
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Online removable knapsack with limited cuts
- Maximizing the total profit of rectangles packed into a rectangle
- Online removable square packing
- Approximation algorithms for orthogonal packing problems for hypercubes
- On the two-dimensional knapsack problem
- Stochastic on-line knapsack problems
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Online Minimization Knapsack Problem
- Optimal Resource Augmentations for Online Knapsack
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Algorithm Theory - SWAT 2004
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Mathematical Foundations of Computer Science 2005
