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

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

Jump to navigation Jump to search

You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in the group: Users.

You can view and copy the source of this page.

== 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 ==

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/$O(n%5E3)$_Dynamic_Programming_(Weighted_Activity_Selection_Problem_Interval_Scheduling)"

Navigation menu