Notes for Lecture 7

@inproceedings{Trevisan2006NotesFL,
  title={Notes for Lecture 7},
  author={Luca Trevisan and Robert Krauthgamer},
  year={2006}
}
1. Max-Cut – problem definiton: Given an undirected graph G = (V,E), find a partition of the vertex set V = S ∪ S̄ that maximizes the number of cut-edges (edges with an endpoint in S and an endpoint in S̄). Examples: A clique, a bipartite graph, an odd cycle. The problem is NP-hard [7]. Can be approximated within factor 1/2 [11]. Exercise 1: Show that local… CONTINUE READING