A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
From MaRDI portal
Publication:5363013
DOI10.1137/1.9781611973730.98zbMath1371.90115OpenAlexW4254244567WikidataQ58203662 ScholiaQ58203662MaRDI QIDQ5363013
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973730.98
Related Items (14)
Mallows-Smoothed Distribution over Rankings Approach for Modeling Choice ⋮ A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem ⋮ On the Approximability of Orthogonal Order Preserving Layout Adjustment ⋮ Resource allocation problem under single resource assignment ⋮ On the number of anchored rectangle packings for a planar point set ⋮ On the Number of Anchored Rectangle Packings for a Planar Point Set ⋮ Approximation and online algorithms for multidimensional bin packing: a survey ⋮ A tight \((3/2+\varepsilon)\)-approximation for skewed strip packing ⋮ Improved Algorithm for Resource Allocation Problems ⋮ A Tight (3/2+ε) Approximation for Skewed Strip Packing. ⋮ Anchored rectangle and square packings ⋮ Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack ⋮ On the complexity of anchored rectangle packing ⋮ Closing the Gap for Pseudo-Polynomial Strip Packing
This page was built for publication: A quasi-PTAS for the Two-Dimensional Geometric Knapsack Problem
