2D knapsack: packing squares
From MaRDI portal
Publication:388093
DOI10.1016/J.TCS.2012.07.035zbMATH Open1359.90121OpenAlexW2242577359MaRDI QIDQ388093FDOQ388093
Authors: Yan Lan, Xin Han, Chenyang Zhou, Attila Benko, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Stochastic on-line knapsack problems
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- Title not available (Why is that?)
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Maximizing the total profit of rectangles packed into a rectangle
- Optimal Resource Augmentations for Online Knapsack
- On the two-dimensional knapsack problem
- Approximation algorithms for orthogonal packing problems for hypercubes
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Online minimization knapsack problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Online removable knapsack with limited cuts
- Title not available (Why is that?)
- Algorithm Theory - SWAT 2004
- Finite-State Online Algorithms and Their Automated Competitive Analysis
- Mathematical Foundations of Computer Science 2005
- Online removable square packing
Cited In (2)
This page was built for publication: 2D knapsack: packing squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q388093)
