1 / 11

CSE 202 - Algorithms

CSE 202 - NP-complete. 2. Decision Problems. Instance: an input, an output, and a size.Problem: a set of instances.Decision Problem: Problem where each instance's output is ?T" or ?F". ?Given graph G and nodes x and y, what is the shortest path from x to y?" is not a decision problem.?Given G, x

sanne
Download Presentation

CSE 202 - Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

    1. 6/3/03 CSE 202 - NP-complete CSE 202 - Algorithms Incomplete notes on NP Completeness

    2. CSE 202 - NP-complete 2 Decision Problems Instance: an input, an output, and a size. Problem: a set of instances. Decision Problem: Problem where each instance’s output is “T” or “F”. “Given graph G and nodes x and y, what is the shortest path from x to y?” is not a decision problem. “Given G, x, y, and k, is there a path from x to y of length ? k?” Usually, given an algorithm for a decision problem, one can use it to solve the associated optimization problem. E.g., use binary search: “Is there a path of length ? 50?”, “? 25?“, “? 37?“, ... .

More Related