Pages that link to "Item:Q1123613"
From MaRDI portal
The following pages link to Improved bounds for rectangular and guillotine partitions (Q1123613):
Displaying 13 items.
- Cut equivalence of \(d\)-dimensional guillotine partitions (Q397169) (← links)
- On heuristics for minimum length rectilinear partitions (Q582084) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574) (← links)
- On optimal guillotine partitions approximating optimal \(d\)-box partitions (Q1327171) (← links)
- Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374) (← links)
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Improved bounds for the extremal number of subdivisions (Q2001982) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- On three soft rectangle packing problems with guillotine constraints (Q2423793) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING (Q4762911) (← links)
- Optimal rectangular partitions (Q4797949) (← links)
