lecture_24

lecture_24 - Introduction to Algorithms 6.046J/18.401J...

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

View Full Document Right Arrow Icon
Introduction to Algorithms 6.046J/18.401J Lecture 24 Prof. Piotr Indyk
Background image of page 1

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

View Full DocumentRight Arrow Icon
Dealing with Hard Problems What to do if: – Divide and conquer – Dynamic programming –Greedy – Linear Programming/Network Flows –… does not give a polynomial time algorithm? © Piotr Indyk Introduction to Algorithms December 8, 2004 L24.2
Background image of page 2
Dealing with Hard Problems Solution I: Ignore the problem – Can’t do it ! There are thousands of problems for which we do not know polynomial time algorithms – For example: • Traveling Salesman Problem (TSP) • Set Cover © Piotr Indyk Introduction to Algorithms December 8, 2004 L24.3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Traveling Salesman Problem Traveling Salesman Problem (TSP) – Input: undirected graph with lengths on edges – Output: shortest cycle that visits each vertex exactly once Best known algorithm: O(n 2 n ) time. © Piotr Indyk Introduction to Algorithms December 8, 2004 L24.4
Background image of page 4
Bank robbery problem: Set Cover: X={plan, shoot, safe, – Input: subsets S 1 …S n of X , drive, scary} i S i = X , |X|=m Sets: – Output: C {1…n} , such –S Joe ={plan, safe} that i C S i = X , and |C| –S Jim ={shoot, scary, minimal drive} Best known algorithm:
Background image of page 5

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

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

Page1 / 15

lecture_24 - Introduction to Algorithms 6.046J/18.401J...

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

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