cos320 slides
2024.05.01
- S00_Introduction
- S01_RepresentativeProblems
- S02_AlgorithmAnalysis
- S03_GreedyAlgorithms
- S03_GreedyAlgorithms0_Coins
- S03_GreedyAlgorithms1_Schedules
- S03_GreedyAlgorithms2_FooBar
- S03_GreedyAlgorithms3_Cache
- S03_GreedyAlgorithms4_Dijkstra
- S03_GreedyAlgorithms5_FooBar
- S03_GreedyAlgorithms6_MinSpanTrees
- S04_DynamicProgramming
- S04_DynamicProgramming0_Intro
- S04_DynamicProgramming1_Schedules
- S04_DynamicProgramming2_LeastSquares
- S04_DynamicProgramming3_Knapsack
- S04_DynamicProgramming4_RNA
- S04_DynamicProgramming5_Examples
- S04_DynamicProgramming6_SeqAlign
- S04_DynamicProgramming7_BellmanFordMoore
- S05_NetworkFlow
- S05_NetworkFlow0_MaxFlowMinCut
- S05_NetworkFlow1_CapacityScaling
- S06_Intractibility
- S06_Intractibility0_PolyTimeReductions
- S06_Intractibility1_PackingAndCovering
- S06_Intractibility2_ConstraintSatisfaction
- S06_Intractibility3_Sequencing
- S06_Intractibility4_Partitioning
- S06_Intractibility5_GraphColoring
- S06_Intractibility6_Numerical