CSE 589Applied AlgorithmsSpring 1999

Table of Contents

CSE 589Applied AlgorithmsSpring 1999

3-Colorability

3-CNF-Sat <P 3-Color

The Gadget

Properties of the Gadget

Reduction by Example

Satisfaction Example

Satisfaction Example

Non-Satisfaction Example

Naming the Gadget

General Construction

Reductions

Exact Cover

Example of Exact Cover

3-Partition

Example of 3-Partition

Bin Packing

Bin Packing Example

Coping with NP-Completeness

Load Balanced Spanning TreeCost Criteria

Deriving c(T)

Examples of c(T)

Another Example

Load Balanced Spanning Tree with Minimum Variance

Branch and Bound

Example of Branch and Bound

Bounding Condition

Graphic of Bounding Condition

Example of Bounding

Branch and Bound Control

Notes on Branch and Bound

Email: ladner@cs.washington.edu

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

Other information:
CSE 589: Applied Algorithms

Download presentation source