Imagen de Portada

Improved Approximation Algorithms for Three-Dimensional Bin Packing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kar, Debajyoti, Khan, Arindam, Rau, Malin
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
por: Kar, Debajyoti, et al.
Publicado: (2026)

Improved Approximation Algorithms for Three-Dimensional Knapsack
por: Jansen, Klaus, et al.
Publicado: (2025)

Improved Hardness of Approximation for Geometric Bin Packing
por: Ray, Arka, et al.
Publicado: (2023)

Near-optimal Algorithms for Stochastic Online Bin Packing
por: Ayyadevara, Nikhil, et al.
Publicado: (2022)

Hardness and Tight Approximations of Demand Strip Packing
por: Jansen, Klaus, et al.
Publicado: (2024)

A Tight ($3/2 + \varepsilon$)-Approximation Algorithm for Demand Strip Packing
por: Eberle, Franziska, et al.
Publicado: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
por: Garg, Mohit, et al.
Publicado: (2024)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
por: Hebbar, Anish, et al.
Publicado: (2024)

ETH-Tight Algorithm for Cycle Packing on Unit Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2024)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
por: Albers, Susanne, et al.
Publicado: (2025)

Approximation Algorithms for Smallest Intersecting Balls
por: Zheng, Jiaqi, et al.
Publicado: (2024)

FPT Constant Approximation Algorithms for Colorful Sum of Radii
por: Liu, Shuilian, et al.
Publicado: (2025)

Online Sorting and Translational Packing of Convex Polygons
por: Aamand, Anders, et al.
Publicado: (2021)

Polynomial-Time Approximation Schemes for Independent Packing Problems on Fractionally Tree-Independence-Number-Fragile Graphs
por: Galby, Esther, et al.
Publicado: (2023)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
por: Ebbens, Matthijs, et al.
Publicado: (2024)

Improved Algorithms for Distance Selection and Related Problems
por: Wang, Haitao, et al.
Publicado: (2023)

Green Bin Packing
por: Bibbens, Jackson, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

An Improved Approximation Algorithm for Metric Triangle Packing
por: Zhao, Jingyang, et al.
Publicado: (2024)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Approximate Algorithms for Chamfer Distance Under Translation
por: Halevi, Gil, et al.
Publicado: (2026)

The Support of Bin Packing is Exponential
por: Jansen, Klaus, et al.
Publicado: (2025)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
por: P V, Althaf, et al.
Publicado: (2026)

Parameterized Approximation of Rectangle Stabbing
por: Chu, Huairui, et al.
Publicado: (2026)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

Adversarially Robust Approximate Furthest Neighbor
por: Banihashem, Kiarash, et al.
Publicado: (2026)

Approximately: Independence Implies Vertex Cover
por: Har-Peled, Sariel
Publicado: (2023)

The Power of Migrations in Dynamic Bin Packing
por: Mellou, Konstantina, et al.
Publicado: (2024)

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
por: Abrahamsen, Mikkel, et al.
Publicado: (2020)

On Approximating the Weighted Region Problem in Square Tessellations
por: Kakimura, Naonori, et al.
Publicado: (2024)

Faster Approximation Scheme for Euclidean $k$-TSP
por: van Wijland, Ernest, et al.
Publicado: (2023)

Data Structures for Approximate Discrete Fréchet Distance
por: van der Hoog, Ivor, et al.
Publicado: (2022)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
por: Zhao, Jingyang, et al.
Publicado: (2025)

Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
por: Gadekar, Ameet, et al.
Publicado: (2025)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2026)

FPT Constant-Approximations for Capacitated Clustering to Minimize the Sum of Cluster Radii
por: Bandyapadhyay, Sayan, et al.
Publicado: (2023)

Online Bin Packing with Item Size Estimates
por: Gehnen, Matthias, et al.
Publicado: (2025)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
por: Lokshtanov, Daniel, et al.
Publicado: (2024)