Tamaki, Tokuyama (approximate) (2-dimensional Maximum subarray problem)

From Algorithm Wiki

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/doi/pdf/10.5555/314613.314823

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Tamaki,_Tokuyama_(approximate)_(2-dimensional_Maximum_subarray_problem)&oldid=45691"