- Whole document: [1-437] (std · pr4 · pr1 · lec)
- Part 1. Organizational Matters [2-10] (std · pr4 · pr1 · lec)
- Contents [8-8]
- Literatur [9-10]
- Part 2. Linear Programming [11-217] (std · pr4 · pr1 · lec)
- Introduction to Linear Programming [12-52] (std · pr4 · pr1 · lec)
- Simplex Algorithm [53-76] (std · pr4 · pr1 · lec)
- Duality [77-116] (std · pr4 · pr1 · lec)
- Weak Duality [77-81] (std · pr4 · pr1 · lec)
- Simplex and Duality [82-84] (std · pr4 · pr1 · lec)
- Strong Duality [85-102] (std · pr4 · pr1 · lec)
- Interpretation of Dual Variables [103-109] (std · pr4 · pr1 · lec)
- Computing Duals [110-116] (std · pr4 · pr1 · lec)
- Degeneracy Revisited [117-132] (std · pr4 · pr1 · lec)
- Klee Minty Cube [133-147] (std · pr4 · pr1 · lec)
- Seidels LP-algorithm [148-166] (std · pr4 · pr1 · lec)
- The Ellipsoid Algorithm [167-217] (std · pr4 · pr1 · lec)
- Part 3. Approximation Algorithms [218-437] (std · pr4 · pr1 · lec)
- Introduction to Approximation [219-234] (std · pr4 · pr1 · lec)
- Integer Programs [235-248] (std · pr4 · pr1 · lec)
- Basic Techniques [249-275] (std · pr4 · pr1 · lec)
- Deterministic Rounding [249-252]
- Rounding the Dual [253-257]
- Primal Dual Technique [258-259]
- Greedy [260-265]
- Randomized Rounding [266-275]
- Scheduling on Identical Machines [276-289] (std · pr4 · pr1 · lec)
- Local Search [276-283]
- Greedy [284-289]
- Rounding Data + Dynamic Programming [290-336] (std · pr4 · pr1 · lec)
- Knapsack [290-294]
- Scheduling Revisited [295-307]
- Bin Packing [308-317]
- Advanced Rounding for Bin Packing [318-336]
- Randomized Rounding [337-373] (std · pr4 · pr1 · lec)
- MAXSAT [337-358]
- MAXCUT [359-373]
- Primal Dual Techniques [374-407] (std · pr4 · pr1 · lec)
- Primal Dual Revisited [374-380]
- Feedback Vertex Set for Undirected Graphs [381-388]
- Primal Dual for Shortest Path [389-395]
- Steiner Forest [396-407]
- Cuts & Metrics [408-421] (std · pr4 · pr1 · lec)
- TSP [422-437] (std · pr4 · pr1 · lec)