{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

421_06au_b

# 421_06au_b - Five Problems CSE 421 Richard Anderson July 1...

This preview shows pages 1–7. Sign up to view the full content.

July 1, 2009 CSE 421, University of Washington, Autumn 2006 1 Five Problems CSE 421 Richard Anderson

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
July 1, 2009 CSE 421, University of Washington, Autumn 2006 2 Theory of Algorithms What is expertise? How do experts differ from novices? Point of slide – experts have a Structure of knowledge
July 1, 2009 CSE 421, University of Washington, Autumn 2006 3 Introduction of five problems Show the types of problems we will be considering in the class Examples of important types of problems Similar looking problems with very different characteristics Problems Scheduling Weighted Scheduling Bipartite Matching Maximum Independent Set Competitive Facility Location

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
July 1, 2009 CSE 421, University of Washington, Autumn 2006 4 What is a problem? Instance Solution Constraints on solution Measure of value Example: Minimum Spanning Tree Graph Set of edges Tree constraints Edge costs
July 1, 2009 CSE 421, University of Washington, Autumn 2006 5 Problem: Scheduling Suppose that you own a banquet hall You have a series of requests for use of the hall: (s 1 , f 1 ), (s 2 , f 2 ), . . . Find a set of requests as large as possible with no overlap

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
CSE 421, University of Washington, Autumn 2006 6 What is the largest solution? Student
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 24

421_06au_b - Five Problems CSE 421 Richard Anderson July 1...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online