Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming - Coggle Diagram
Dynamic Programming
np-hard problems
Problem be very small
heurisyic
Aproximation of optimal solution
polynomial-time approximation algorithm
c-approximation algorithm
performance ratio
traveling salesman problem
P != NP
No c-approximation
Greedy Algorithms for the TSP
Nearest-neighbor algorithm
Multifragment-heuristic algorithm
Minimum-Spanning-Tree–Based Algorithms
Christofides Algorithm
Local Search Heuristics
Knapsack problem
Greedy Algorithms for the Knapsack Problem
Greedy algorithm for the continuous knapsack problem
Examples
Coin row
Change making
Coin collecting
Memory functions
top-down manner
MFKnapsnak