$O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)

From Algorithm Wiki
Revision as of 11:17, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Keep track of answers to O(n^2) subproblems (i, j)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference ==")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{3})$

Space Complexity

$O(n^{2})$ words

(Keep track of answers to O(n^2) subproblems (i, j))

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1953

Reference

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=$O(n%5E3)$_Dynamic_Programming_(Weighted_Activity_Selection_Problem_Interval_Scheduling)&oldid=45585"