Pages that link to "Item:Q1849374"
From MaRDI portal
The following pages link to Partitioning a square into rectangles: NP-Completeness and approximation algorithms (Q1849374):
Displaying 16 items.
- Rectangular partition is polynomial in two dimensions but NP-complete in three (Q808703) (← links)
- An approximation algorithm for dissecting a rectangle into rectangles with specified areas (Q869574) (← links)
- The decomposition of a square into rectangles of minimal perimeter (Q1082348) (← links)
- Partitioning a rectangle into small perimeter rectangles (Q1197044) (← links)
- Approximation algorithms for partitioning a rectangle with interior points (Q1263970) (← links)
- \(\gamma\)-soft packings of rectangles (Q1615640) (← links)
- An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
- Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms (Q1693206) (← links)
- 3D rectangulations and geometric matrix multiplication (Q1702124) (← links)
- Minimum tiling of a rectangle by squares (Q1730580) (← links)
- Rectangle transformation problem (Q2415366) (← links)
- On three soft rectangle packing problems with guillotine constraints (Q2423793) (← links)
- Exact and approximation algorithms for a soft rectangle packing problem (Q2926482) (← links)
- EXACT SOLUTIONS OF RECTANGULAR PARTITIONS VIA INTEGER PROGRAMMING (Q4762911) (← links)
- PACKING SOFT RECTANGLES (Q5493900) (← links)
- An approximation algorithm for optimal piecewise linear interpolations of bounded variable products (Q6086136) (← links)
