Maximum Square Subarray (Maximum Subarray Problem)

From Algorithm Wiki
Jump to navigation Jump to search


Given an $n \times n$ matrix find a maximum subarray with sides of equal length.

Related Problems

Generalizations: Maximum Subarray

Related: 1D Maximum Subarray, 2D Maximum Subarray


$n$: dimension of array

Table of Algorithms

Currently no algorithms in our database for the given problem.

Reductions FROM Problem

Problem Implication Year Citation Reduction
Max-Weight K-Clique if: to-time: $O(n^{d+{1}-\epsilon})$ for $d$-dimensional hypercube arrays
then: from-time: $O(n^{k-\epsilon})$ on $n$ vertex graphs for $k=d+{1}$
2016 link