Partitioning a matrix to minimize the maximum cost

DOI10.1016/0166-218X(94)00154-6zbMATH Open0833.90086MaRDI QIDQ1900148FDOQ1900148

Authors: Massimo Spadoni, Aristide Mingozzi, Salvatore Ricciardelli 

Publication date: 18 March 1996

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

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

zbMATH Keywords

tree search algorithmmatrix partitioningexact and heuristic algorithms

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Most uniform path partitioning and its use in image processing
• Max-Min Tree Partitioning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient implementation of a shifting algorithm
• Title not available (Why is that?)
• An Algorithm for Grey-Level Transformations in Digitized Images

Cited In (8)

• Path equipartition in the Chebyshev norm
• Approximations for the general block distribution of a matrix
• Title not available (Why is that?)
• Optimal matrix-segmentation by rectangles
• Approximations for the general block distribution of a matrix
• On a 2-dimensional equipartition problem
• Least-cost partition algorithms
• 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)