Unformatted text preview: any pair of nodes in the subset. (a) WISP is an optimization problem. De±ne 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
 Fall '11
 Staff
 Graph Theory, LG, polynomial time, Clyde Kruskal, decision version

Click to edit the document details