'Planar 3sat' presentation slideshows

Lecture 2-4 More examples

Lecture 2-4 More examples. Integer Programming. TSP. Knapsack. VC. HC. 3DM. Partition. Planar 3SAT. 3SAT. SAT. Vertex Cover. Given a graph G=(V,E), find a minimum subset C of vertices such that every edge is incident to a vertex in C. Decision Version.

486 views • 47 slides

Lecture 8-9 More examples

Lecture 8-9 More examples. Integer Programming. TSP. Knapsack. VC. HC. 3DM. Partition. Planar 3SAT. 3SAT. SAT. Vertex-Cover is NP-complete. Proof. HC is NP-complete. 3DM. Example of 3DM.

487 views • 37 slides

Partitioning Polygons into Convex Components

472 views • 30 slides