Faster approximation schemes for the two-dimensional knapsack problem

DOI10.1137/1.9781611974782.6MaRDI QIDQ4575740zbMATH OpenOpenAlexFDO

Authors Sandy Heydrich, Andreas Wiese

Publication date 16 July 2018

Published in Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974782.6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
• A quasi-PTAS for the two-dimensional geometric knapsack problem
• There is no EPTAS for two-dimensional knapsack
• An approximation scheme for the two-stage, two-dimensional knapsack problem
• 2D knapsack: packing squares

Cited in

(11)

• Closing the Gap for Pseudo-Polynomial Strip Packing
• A quasi-PTAS for the two-dimensional geometric knapsack problem
• Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
• Analysis of the Period Recovery Error Bound
• Tight complexity bounds for the two-dimensional real knapsack problem
• Approximation and online algorithms for multidimensional bin packing: a survey
• Approximation algorithms for a two-phase knapsack problem
• There is no EPTAS for two-dimensional knapsack
• Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• 2D knapsack: packing squares

This page was built for publication: Faster approximation schemes for the two-dimensional knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575740)