Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
From MaRDI portal
Recommendations
- Faster approximation schemes for the two-dimensional knapsack problem
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- Approximation algorithms for a two-phase knapsack problem
- On the approximability of the two-phase knapsack problem
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Approximability of two variants of multiple knapsack problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- On the two-dimensional knapsack problem
Cited in
(14)- A quasi-PTAS for the two-dimensional geometric knapsack problem
- Faster approximation schemes for the two-dimensional knapsack problem
- 2D knapsack: packing squares
- An approximation scheme for the two-stage, two-dimensional knapsack problem
- On the two-dimensional knapsack problem for convex polygons
- Tight complexity bounds for the two-dimensional real knapsack problem
- Approximation algorithms for a two-phase knapsack problem
- Improved approximation algorithms for 2-dimensional knapsack: packing into multiple l-shapes, spirals, and more
- On the two-dimensional knapsack problem for convex polygons
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- There is no EPTAS for two-dimensional knapsack
- Approximating the geometric knapsack problem in near-linear time and dynamically
- 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 Q4973043)
