Image de couverture de livre

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Albers, Susanne, Gálvez, Waldo, Özdemir, Ömer Behic
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hardness and Tight Approximations of Demand Strip Packing
par: Jansen, Klaus, et autres
Publié: (2024)

Improved Hardness of Approximation for Geometric Bin Packing
par: Ray, Arka, et autres
Publié: (2023)

Improved Approximation Algorithms for Three-Dimensional Bin Packing
par: Kar, Debajyoti, et autres
Publié: (2025)

Near-optimal Algorithms for Stochastic Online Bin Packing
par: Ayyadevara, Nikhil, et autres
Publié: (2022)

A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
par: Eberle, Franziska, et autres
Publié: (2024)

Green Bin Packing
par: Bibbens, Jackson, et autres
Publié: (2025)

The Support of Bin Packing is Exponential
par: Jansen, Klaus, et autres
Publié: (2025)

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Approximations and Hardness of Packing Partially Ordered Items
par: Doron-Arad, Ilan, et autres
Publié: (2024)

The Power of Migrations in Dynamic Bin Packing
par: Mellou, Konstantina, et autres
Publié: (2024)

Online Bin Packing with Item Size Estimates
par: Gehnen, Matthias, et autres
Publié: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
par: Zhao, Jingyang, et autres
Publié: (2025)

Streaming Algorithms for Bin Packing and Vector Scheduling
par: Cormode, Graham, et autres
Publié: (2019)

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling
par: Bringmann, Karl, et autres
Publié: (2026)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
par: Hebbar, Anish, et autres
Publié: (2024)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
par: Gálvez, Waldo, et autres
Publié: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
par: Zhao, Jingyang, et autres
Publié: (2023)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
par: Fujiwara, Hiroshi, et autres
Publié: (2025)

Reconfiguration of Multisets with Applications to Bin Packing
par: Kam, Jeffrey, et autres
Publié: (2024)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
par: Sharma, Eklavya
Publié: (2025)

Packing-Inspired Algorithms for Periodic Scheduling Problems with Harmonic Periods
par: Grus, Josef, et autres
Publié: (2024)

The Traveling Tournament Problem: Improved Algorithms Based on Cycle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Hitting Meets Packing: How Hard Can it Be?
par: Focke, Jacob, et autres
Publié: (2024)

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
par: Jana, Saswata, et autres
Publié: (2026)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
par: Das, Rathish, et autres
Publié: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements
par: Yamano, Ryosuke, et autres
Publié: (2026)

Online busy time scheduling with flexible jobs
par: Albers, Susanne, et autres
Publié: (2024)

Scalable Algorithms for 2-Packing Sets on Arbitrary Graphs
par: Borowitz, Jannick, et autres
Publié: (2023)

Hardness and Approximation for Coloring Digraphs
par: Chalermsook, Parinya, et autres
Publié: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

A Tight Double-Exponentially Lower Bound for High-Multiplicity Bin Packing
par: Jansen, Klaus, et autres
Publié: (2025)

A $(\frac32+\frac1{\mathrm{e}})$-Approximation Algorithm for Ordered TSP
par: Armbruster, Susanne, et autres
Publié: (2024)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
par: Dai, Han, et autres
Publié: (2025)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
par: Chen, Lin, et autres
Publié: (2026)

Improved Approximations for Hard Graph Problems using Predictions
par: Aamand, Anders, et autres
Publié: (2025)