This preview shows page 1. Sign up to view the full content.
Unformatted text preview: any pair of nodes in the subset. (a) WISP is an optimization problem. Dene a decision version of WISP. (b) Show that the decision version is in NP . (c) Show that if you could solve the optimization version in polynomial time that you could also solve the decision version in polynomial time. (d) Show that if you could solve the decision version in polynomial time that you could also solve the optimization version in polynomial time. HINT: First nd the weight of an optimal independent set. 1...
View
Full
Document
This note was uploaded on 01/13/2012 for the course CMSC 351 taught by Professor Staff during the Fall '11 term at University of Louisville.
 Fall '11
 Staff

Click to edit the document details