# What are subproblems?

### Some articles on subproblems, subproblem:

Overlapping Subproblems
... science, a problem is said to have overlapping subproblems if the problem can be broken down into subproblems which are reused several times or a recursive algorithm ... For example, the problem of computing the Fibonacci sequence exhibits overlapping subproblems ... The problem of computing the nth Fibonacci number F(n), can be broken down into the subproblems of computing F(n − 1) and F(n − 2), and then adding the two ...
Dantzig–Wolfe Decomposition - The Algorithm
... to the reduced master program, formulate new objective functions for each subproblem such that the subproblems will offer solutions that improve the current ... Subproblems are re-solved given their new objective functions ... An optimal value for each subproblem is offered to the master program ...
Longest Common Subsequence Problem - Solution For Two Sequences
... can be broken down into smaller, simple "subproblems", which can be broken down into yet simpler subproblems, and so on, until, finally, the solution becomes trivial ... The LCS problem also has overlapping subproblems the solution to a higher subproblem depends on the solutions to several of the lower subproblems ... properties—optimal substructure and overlapping subproblems—can be approached by a problem-solving technique called dynamic programming, in which the solution is built up starting with the ...
Parallel Mesh Generation - Overview
... (2D) or 3-dimensional (3D) mesh generation problem into N smaller subproblems which are solved (i.e ... The subproblems can be formulated to be either tightly coupled, partially coupled or even decoupled ... The coupling of the subproblems determines the intensity of the communication and the amount/type of synchronization required between the subproblems ...
Master Theorem - Generic Form
... a is the number of subproblems in the recursion ... n/b is the size of each subproblem ... Here it is assumed that all subproblems are essentially the same size.) f (n) is the cost of the work done outside the recursive calls, which includes the ...