Geometric Bin Packing Beyond Convexity: Approximation Schemes without Augmentation
cs.CG, cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- A Framework for Efficient Approximation Schemes on Geometric Packing Problems of $d$-dimensional Fat Objects
- A structural approach to kernels for ILPs: Treewidth and Total Unimodularity
Related papers
- The Rhythm of the Tiles: Narrow and Low Temperature Computation and Simulation in Synchronous Tile Self-Assembly
- k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
- Covering Points with Rectangular Boundaries
- Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
- Quadratic Complexity of Voronoi Diagrams in R cubed for Lines in a Single Ruling of a Regulus
- Minimum central circles: chain order, seam obstructions, and exact finite certification