Can I read Largest Black Subrectangle Problem on EtoBox?

Largest Black Subrectangle Problem by Thu Trang is a document available to read on EtoBox.

What is Largest Black Subrectangle Problem about?

The document discusses the problem of finding the largest black sub-rectangle in a given m × n matrix of black and white unit squares. It outlines the input format, which includes the dimensions of the matrix and the matrix itself, and presents methods for solving the problem, including a naive brute force approach and a histogram-based approach. The document details the algorithm

Author

Thu Trang

Language

EN