Along the Way

• Analysis of algorithms

• Data structures

• NP-completeness

• Dynamic programming

• Greedy algorithms

• Clustering algorithms

• Branch-and-bound algorithms

• Approximation algorithms

• Classics of algorithms

Previous slide

Next slide

Back to first slide

View graphic version