Improved approximation for two-dimensional vector multiple knapsack
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- A Fast Approximation Scheme for the Multiple Knapsack Problem
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
- A sharp concentration inequality with applications
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- Improved approximation for two-dimensional vector multiple knapsack
- Improved approximations for vector bin packing via iterative randomized rounding
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Parameterized approximation scheme for the multiple knapsack problem
- There is no EPTAS for two-dimensional knapsack
- There is no asymptotic PTAS for two-dimensional vector packing
- Tight approximation algorithms for maximum separable assignment problems
- Tight vector bin packing with few small items via fast exact matching in multigraphs
Cited in
(2)
This page was built for publication: Improved approximation for two-dimensional vector multiple knapsack
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953200)
