Saved in:
| Main Authors: | Zhou, Yi, Fu, Haocheng, Liu, Yiping, Mao, Jian, Fu, Zhang-Hua, Wang, Yuyi |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.00484 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025)
by: Kar, Debajyoti, et al.
Published: (2025)
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
by: Sun, Ming, et al.
Published: (2022)
by: Sun, Ming, et al.
Published: (2022)
Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)
by: Touli, Elena Farahbakhsh, et al.
Published: (2025)
Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
by: Rahmani, Atieh, et al.
Published: (2025)
by: Rahmani, Atieh, et al.
Published: (2025)
Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
by: Lyu, Weiran, et al.
Published: (2024)
by: Lyu, Weiran, et al.
Published: (2024)
Improved Hardness of Approximation for Geometric Bin Packing
by: Ray, Arka, et al.
Published: (2023)
by: Ray, Arka, et al.
Published: (2023)
Framework for $\exists \mathbb{R}$-Completeness of Two-Dimensional Packing Problems
by: Abrahamsen, Mikkel, et al.
Published: (2020)
by: Abrahamsen, Mikkel, et al.
Published: (2020)
Edit Distance between Merge Trees
by: Sridharamurthy, Raghavendra, et al.
Published: (2022)
by: Sridharamurthy, Raghavendra, et al.
Published: (2022)
Decoupling Geometry from Optimization in 2D Irregular Cutting and Packing Problems: an Open-Source Collision Detection Engine
by: Gardeyn, Jeroen, et al.
Published: (2025)
by: Gardeyn, Jeroen, et al.
Published: (2025)
Locally Correct Interleavings between Merge Trees
by: Beurskens, Thijs, et al.
Published: (2025)
by: Beurskens, Thijs, et al.
Published: (2025)
A Deformation-based Edit Distance for Merge Trees
by: Wetzels, Florian, et al.
Published: (2022)
by: Wetzels, Florian, et al.
Published: (2022)
One Dimensional Asymptotic Plateau Problem in $n$-Dimensional Asymptotically Conical Manifolds
by: Liu, Jiayin, et al.
Published: (2025)
by: Liu, Jiayin, et al.
Published: (2025)
Towards Computing Average Merge Tree Based on the Interleaving Distance
by: Touli, Elena Farahbakhsh, et al.
Published: (2026)
by: Touli, Elena Farahbakhsh, et al.
Published: (2026)
A Finitely Stable Edit Distance for Merge Trees
by: Pegoraro, Matteo
Published: (2021)
by: Pegoraro, Matteo
Published: (2021)
An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
by: P V, Althaf, et al.
Published: (2026)
by: P V, Althaf, et al.
Published: (2026)
New Sphere Packings from the Antipode Construction
by: Chen, Ruitao, et al.
Published: (2025)
by: Chen, Ruitao, et al.
Published: (2025)
Rapid and Precise Topological Comparison with Merge Tree Neural Networks
by: Qin, Yu, et al.
Published: (2024)
by: Qin, Yu, et al.
Published: (2024)
Comparative Analysis of Merge Trees using Local Tree Edit Distance
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)
by: Sridharamurthy, Raghavendra, et al.
Published: (2021)
Categorizing Merge Tree Edit Distances by Stability using Minimal Vertex Perturbation
by: Wetzels, Florian, et al.
Published: (2025)
by: Wetzels, Florian, et al.
Published: (2025)
Accelerating Computation of Stable Merge Tree Edit Distances using Parameterized Heuristics
by: Wetzels, Florian, et al.
Published: (2025)
by: Wetzels, Florian, et al.
Published: (2025)
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
by: Beurskens, Thijs, et al.
Published: (2023)
by: Beurskens, Thijs, et al.
Published: (2023)
MergeIT: From Selection to Merging for Efficient Instruction Tuning
by: Cai, Hongyi, et al.
Published: (2025)
by: Cai, Hongyi, et al.
Published: (2025)
Intrinsic Bottleneck Distance for Merge Trees
by: Beers, David, et al.
Published: (2025)
by: Beers, David, et al.
Published: (2025)
Optimal Algorithm for the Planar Two-Center Problem
by: Cho, Kyungjin, et al.
Published: (2020)
by: Cho, Kyungjin, et al.
Published: (2020)
How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)
by: Har-Peled, Sariel, et al.
Published: (2021)
The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
by: Chagas, Vítor Gomes, et al.
Published: (2026)
by: Chagas, Vítor Gomes, et al.
Published: (2026)
Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-based Edit Distance
by: Wetzels, Florian, et al.
Published: (2023)
by: Wetzels, Florian, et al.
Published: (2023)
Partitioning a Polygon Into Small Pieces
by: Abrahamsen, Mikkel, et al.
Published: (2022)
by: Abrahamsen, Mikkel, et al.
Published: (2022)
Fast Neighborhood Search Heuristics for the Colored Bin Packing Problem
by: da Silva, Renan F. F., et al.
Published: (2023)
by: da Silva, Renan F. F., et al.
Published: (2023)
RCD structures on singular Kahler spaces of complex dimension three
by: Fu, Xin, et al.
Published: (2025)
by: Fu, Xin, et al.
Published: (2025)
Covering and Partitioning Complex Objects with Small Pieces
by: Aamand, Anders, et al.
Published: (2026)
by: Aamand, Anders, et al.
Published: (2026)
Merge Trees of Periodic Filtrations
by: Edelsbrunner, Herbert, et al.
Published: (2024)
by: Edelsbrunner, Herbert, et al.
Published: (2024)
Geometric Langlands for Irregular Theta Connections and Epipelagic Representations
by: Chen, Tsao-Hsien, et al.
Published: (2024)
by: Chen, Tsao-Hsien, et al.
Published: (2024)
A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance
by: Chambers, Erin Wolf, et al.
Published: (2024)
by: Chambers, Erin Wolf, et al.
Published: (2024)
On the cohomological dimension of Siegel modular varieties and the modularity of formal Siegel modular forms
by: Fan, Haocheng
Published: (2025)
by: Fan, Haocheng
Published: (2025)
A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
by: Li, Qian, et al.
Published: (2024)
by: Li, Qian, et al.
Published: (2024)
Homological Filling and Minimal Varifolds in Four-Dimensional Einstein Manifolds
by: Fu, Wenjie, et al.
Published: (2025)
by: Fu, Wenjie, et al.
Published: (2025)
Optimal Bounds for the Number of Pieces of Near-Circuit Hypersurfaces
by: Deng, Weixun, et al.
Published: (2025)
by: Deng, Weixun, et al.
Published: (2025)
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)
Linear-Time $(1+\varepsilon)$-Approximation Algorithms for Two-Line-Center Problems
by: Chung, Chaeyoon, et al.
Published: (2026)
by: Chung, Chaeyoon, et al.
Published: (2026)
Similar Items
-
Improved Approximation Algorithms for Three-Dimensional Bin Packing
by: Kar, Debajyoti, et al.
Published: (2025) -
A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs
by: Sun, Ming, et al.
Published: (2022) -
Efficient Heuristic Algorithms for Interleaving Distance between Merge Trees
by: Touli, Elena Farahbakhsh, et al.
Published: (2025) -
Stable Trajectory Clustering: An Efficient Split and Merge Algorithm
by: Rahmani, Atieh, et al.
Published: (2025) -
Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
by: Lyu, Weiran, et al.
Published: (2024)