1. Max-Cut a b
Edges cut: 8 w c d e 1

2. Max-Cut a b
Edges cut: 8 w c d e 2

3. GreedyMaxCut a
Edges cut: 0 3

4. GreedyMaxCut a b
Edges cut: 1 4

5. GreedyMaxCut a b
Edges cut: 2 c 5

6. GreedyMaxCut a b
Edges cut: 3 c d 6

7. GreedyMaxCut a b
Edges cut: 3 c d e 7

8. GreedyMaxCut a b
Edges cut: 4 w c d e 8

9. Comment cards 9

10. a b w c d e Vertex Cover ---> Max-Cut
w-b, w-e have weights 1 – 1 = 0 e 10

11. a b w c d e Vertex Cover ---> Max-Cut Edges cut: 6
Edges incident to {a, c}:
a-c, c-d, a-b, a-d w c d
4 *2 - |{a, c}| = 6 e 11

12. a b w c d e Vertex Cover ---> Max-Cut Edges cut: 8
Edges incident to {a, d}:
All 5 edges w c d
5 *2 - |{a, d}| = 8 e 12

13. Comment cards 13