Maximum Subarray

Given a $d$ -dimensional array $M$ with $n^d$ real-valued entries, find the $d$ -dimensional subarray of $M$ which maximizes the sum of the elements it contains.

Parameters

$n$ : length of array
$d$ : dimensionality of array

Related Problems

Maximum Consecutive Subsums

dD Maximum Subarray

Insufficient data to display graph

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Insuffient Data to display table

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table