Faster approximation schemes for the two-dimensional knapsack problem

DOI10.1137/1.9781611974782.6zbMath1411.68190OpenAlexW4233582883MaRDI QIDQ4575740

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)

Related Items (4)

Approximation and online algorithms for multidimensional bin packing: a survey ⋮ Analysis of the Period Recovery Error Bound ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing

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