ASPECTS OF COMBINATORIAL OPTIMIZATION
Kumamoto University
January 2011


CONTENTS

Part A: Min-Max Theorems
Lecture 1: Hall's Marriage Theorem
Lecture 2: König's Theorem and Dilworth's Theorem
Lecture 3: Applications
Lecture 4: Generalizations

Part B: Graph Algorithms
Lecture 5: Augmenting Paths
Lecture 6: Spanning Trees
Lecture 7: Traversing Circuits

Part C: Test (40min.)



Lecture Notes



Thomas Britz
University of New South Wales
britz@unsw.edu.au