421_06au_b - Theory of Algorithms Five Problems CSE 421...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
August 30, 2006 CSE 421, University of Washington, Autumn 2006 1 Five Problems CSE 421 Richard Anderson August 30, 2006 CSE 421, University of Washington, Autumn 2006 2 Theory of Algorithms • What is expertise? • How do experts differ from novices? August 30, 2006 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 Scheduling August 30, 2006 CSE 421, University of Washington, Autumn 2006 4 What is a problem? • Instance •So lu t ion • Constraints on solution • Measure of value August 30, 2006 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 August 30, 2006 CSE 421, University of Washington, Autumn 2006
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

421_06au_b - Theory of Algorithms Five Problems CSE 421...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online