Image de couverture de livre

MergeDJD: A Fast Constructive Algorithm with Piece Merging for the Two-Dimensional Irregular Bin Packing Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhou, Yi, Fu, Haocheng, Liu, Yiping, Mao, Jian, Fu, Zhang-Hua, Wang, Yuyi
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
par: Touli, Elena Farahbakhsh, et autres
Publié: (2025)

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
par: Lyu, Weiran, et autres
Publié: (2024)

Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
par: Rahmani, Atieh, et autres
Publié: (2025)

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
par: Sun, Ming, et autres
Publié: (2022)

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

Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
par: Abrahamsen, Mikkel, et autres
Publié: (2020)

Edit Distance between Merge Trees
par: Sridharamurthy, Raghavendra, et autres
Publié: (2022)

Locally Correct Interleavings between Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2025)

Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine
par: Gardeyn, Jeroen, et autres
Publié: (2025)

A Deformation-based Edit Distance for Merge Trees
par: Wetzels, Florian, et autres
Publié: (2022)

One Dimensional Asymptotic Plateau Problem in $n$-Dimensional Asymptotically Conical Manifolds
par: Liu, Jiayin, et autres
Publié: (2025)

Towards Computing Average Merge Tree Based on the Interleaving Distance
par: Touli, Elena Farahbakhsh, et autres
Publié: (2026)

A Finitely Stable Edit Distance for Merge Trees
par: Pegoraro, Matteo
Publié: (2021)

New Sphere Packings from the Antipode Construction
par: Chen, Ruitao, et autres
Publié: (2025)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
par: P V, Althaf, et autres
Publié: (2026)

Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
par: Wetzels, Florian, et autres
Publié: (2025)

Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
par: Wetzels, Florian, et autres
Publié: (2025)

Rapid and Precise Topological Comparison with Merge Tree Neural Networks
par: Qin, Yu, et autres
Publié: (2024)

Comparative Analysis of Merge Trees using Local Tree Edit Distance
par: Sridharamurthy, Raghavendra, et autres
Publié: (2021)

Optimal Algorithm for the Planar Two-Center Problem
par: Cho, Kyungjin, et autres
Publié: (2020)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

MergeIT: From Selection to Merging for Efficient Instruction Tuning
par: Cai, Hongyi, et autres
Publié: (2025)

How Packed Is It, Really?
par: Har-Peled, Sariel, et autres
Publié: (2021)

Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
par: Wetzels, Florian, et autres
Publié: (2023)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
par: Chagas, Vítor Gomes, et autres
Publié: (2026)

Intrinsic Bottleneck Distance for Merge Trees
par: Beers, David, et autres
Publié: (2025)

Partitioning a Polygon Into Small Pieces
par: Abrahamsen, Mikkel, et autres
Publié: (2022)

Fast Neighborhood Search Heuristics for the Colored Bin Packing Problem
par: da Silva, Renan F. F., et autres
Publié: (2023)

Covering and Partitioning Complex Objects with Small Pieces
par: Aamand, Anders, et autres
Publié: (2026)

RCD structures on singular Kahler spaces of complex dimension three
par: Fu, Xin, et autres
Publié: (2025)

Geometric Langlands for Irregular Theta Connections and Epipelagic Representations
par: Chen, Tsao-Hsien, et autres
Publié: (2024)

Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
par: Chung, Chaeyoon, et autres
Publié: (2026)

Optimal Bounds for the Number of Pieces of Near-Circuit Hypersurfaces
par: Deng, Weixun, et autres
Publié: (2025)

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
par: Chambers, Erin Wolf, et autres
Publié: (2024)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
par: da Silva, Renan Fernando Franco, et autres
Publié: (2026)

QuickMerge++: Fast Token Merging with Autoregressive Prior
par: Liu, Dong, et autres
Publié: (2025)

Boundary Value Problem and Discrete Schwarz-Pick Lemma for Generalized Hyperbolic Circle Packings
par: Hu, Guangming, et autres
Publié: (2024)

Homological Filling and Minimal Varifolds in Four-Dimensional Einstein Manifolds
par: Fu, Wenjie, et autres
Publié: (2025)

On the cohomological dimension of Siegel modular varieties and the modularity of formal Siegel modular forms
par: Fan, Haocheng
Publié: (2025)