No. Title Author Year
1 A PTAS for Packing Hypercubes into a Knapsack Jansen, Klaus et al. 2022
2 Approximation Algorithms for Round-UFP and Round-SAP Kar, Debajyoti et al. 2022
3 Near-Optimal Algorithms for Stochastic Online Bin Packing Ayyadevara, Nikhil ^* et al. 2022
4 Tight Approximation Algorithms for Two-Dimensional Guillotine Strip Packing Khan, Arindam et al. 2022
5 Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More Gálvez, Waldo et al. 2021
6 On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem Khan, Arindam et al. 2021
7 Peak Demand Minimization via Sliced Strip Packing Deppert, Max A. et al. 2021
8 Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items Khan, Arindam et al. 2021
9 A Tight (3/2+ε) Approximation for Skewed Strip Packing Gálvez, Waldo et al. 2020
10 Best Fit Bin Packing with Random Order Revisited Albers, Susanne et al. 2020
11 On Guillotine Separability of Squares and Rectangles Khan, Arindam et al. 2020
12 Improved Online Algorithms for Knapsack and GAP in the Random Order Model Albers, Susanne et al. 2019
13 Improved Pseudo-Polynomial-Time Approximation for Strip Packing Gálvez, Waldo et al. 2016
14 On Weighted Bipartite Edge Coloring Khan, Arindam et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 14


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI