• Back
• Video Tutorials
• Slides
• Links

Combinatorial Optimization

• Algorithms, Analyzing & Designing Algorithms
• Correctness of Algorithms
• Greedy Algorithms - Introduction to Greedy Algorithms
• Greedy Choice Property
• Greedy vs. Dynamic Programming
• Fractional Knapsack Problem, Activity Selection Problem
• Huffman Encoding
• Task Scheduling Problem
• Coin Changing Problem
• Kruskal’s and Prim’s Minimum Spanning Tree Algorithms
• Divide and Conquer Algorithms
• Quick Sort
• Merge Sort
• Proof of Correctness, and Run Time Analysis
• ntroduction to Dynamic Programming
• Principle of Optimality
• Optimal Substructure Property
• Assembly Line Scheduling
• Matrix Chain Multiplication
• Traveling Salesperson Problem and Runtime Analysis
• Graph Searching and Shortest Path Problems
• Breadth First Search
• Depth First Search
• Single Source and All Pair Sho
• Flow Networks
• Formulating Problem as Linear Programs
• Computational Geometry
• Number Theoretic
• String Matching Algorithms
• Simplex Algorithm and Integer Linear Programming
• NP Completeness and Approximation Algorithms
• Polynomial Time Verification
• NP Completeness and Reducibility
• NP Complete Problems and Approximation Algorithms