CSE 589 Part VI

11/1/00


Click here to start


Table of Contents

CSE 589 Part VI

Reading

Techniques for Dealing with NP-complete Problems

PPT Slide

Backtracking Example: Finding a 3-coloring of a graph

Graph Recursion Tree

Branch-and-Bound

Example: Minimum number of colors in graph coloring

Branch-and-Bound

How might you obtain such a bound?

Bounds for clique problem

Two things you can do with linear program

PPT Slide

Approximation Algorithms

Example 1: Vertex Cover

The Vertex Cover Produced Is At Most Twice The Size Of The Optimal VC

Example 2: Approximation Algorithm for Euclidean Traveling Salesman Problem

Approximation Algorithm For Euclidean TSP

Better version of algorithm

Better version of algorithm

Better version of algorithm

PPT Slide

PPT Slide

PPT Slide

This algorithm has provably performance guarantee

PPT Slide

PPT Slide

Randomized Rounding

Example: Global Wiring In A Gate Array

Simplifications

Cast as Integer Program

Randomized Rounding

Your turn to analyze an approximation algorithm for an NP-complete problem.

Author:  Anna Karlin

Email: karlin@cs.washington.edu

Home Page: http://www.cs.washington.edu/education/courses/589

Download presentation source