Optimal substructure

Creator

Creator

Seonglae Cho

Created

Created

2023 Oct 12 7:9

Editor

Editor

Seonglae Cho

Edited

Edited

2023 Oct 12 7:11

Refs

Refs

An optimal solution to a problem (instance) contains optimal solutions to subproblem

Optimal substructure

In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems. This property is used to determine the usefulness of greedy algorithms for a problem.

Optimal substructure

https://en.wikipedia.org/wiki/Optimal_substructure

Optimal substructure

Backlinks

Greedy Algorithm Bellman-Ford algorithm Problem Solving Problem Solving Assembly line scheduling

Recommendations

//////