Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem)
Jump to navigation
Jump to search
Time Complexity
$O(n^(omega)$ * (-log(epsilon))/epsilon)
Space Complexity
words
()
Description
Approximate?
Approximate
Approximation Factor: (1-epsilon)
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1998
Reference
https://dl-acm-org.ezproxy.canberra.edu.au/doi/pdf/10.5555/314613.314823