Partitioning a matrix to minimize the maximum cost

DOI10.1016/0166-218X(94)00154-6MaRDI QIDQ1900148zbMATH OpenFDO

Authors Massimo Spadoni, Aristide Mingozzi, Salvatore Ricciardelli

Publication date 18 March 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

tree search algorithmmatrix partitioningexact and heuristic algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Recommendations

• Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
• Approximations for the general block distribution of a matrix
• Approximations for the general block distribution of a matrix
• Optimal matrix-segmentation by rectangles
• scientific article; zbMATH DE number 432993

Cites work

• scientific article; zbMATH DE number 3900665 (Why is no real title available?)
• scientific article; zbMATH DE number 4031028 (Why is no real title available?)
• scientific article; zbMATH DE number 3688765 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An Algorithm for Grey-Level Transformations in Digitized Images
• Efficient implementation of a shifting algorithm
• Max-Min Tree Partitioning
• Most uniform path partitioning and its use in image processing

Cited in

(9)

• Path equipartition in the Chebyshev norm
• Approximations for the general block distribution of a matrix
• scientific article; zbMATH DE number 432993 (Why is no real title available?)
• On a 2-dimensional equipartition problem
• Approximations for the general block distribution of a matrix
• Optimal matrix-segmentation by rectangles
• Least-cost partition algorithms
• Near-optimal asymmetric binary matrix partitions
• Partitioning a matrix with non-guillotine cuts to minimize the maximum cost

This page was built for publication: Partitioning a matrix to minimize the maximum cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900148)