Design of Algorithms Eight paradigms:
1. reduce to known problem (eg. graph problem)
2. divide and conquer
3. greedy algorithm
4. dynamic programming
5. branch and bound search
6. local search
7. metaheuristics: tabu search, genetic algorithms, simulated annealing, etc.
8. randomized/probabilistic algorithm
No comments:
Post a Comment