Pages that link to "Item:Q1900148"
From MaRDI portal
The following pages link to Partitioning a matrix to minimize the maximum cost (Q1900148):
Displaying 8 items.
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- Near-optimal asymmetric binary matrix partitions (Q1702119) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Least-cost partition algorithms (Q1823166) (← links)
- Approximations for the general block distribution of a matrix (Q5054840) (← links)
- Optimal matrix-segmentation by rectangles (Q5902115) (← links)
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost (Q5957361) (← links)
- Approximations for the general block distribution of a matrix (Q5958117) (← links)