This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Problem 2 . [Self-Reductions] In each case below, assume that you are given a black box which can answer the decision version of the indicated problem. Use a polynomial number of calls to the black box to construct the desired set. Independent set: Given a graph G and an integer k , does G have a subset of k vertices that are pairwise nonadjacent? Subset sum: Given a multiset (elements can appear more than once) X = x 1 ,...,x k of positive integers, and a positive integer S , does there exist a subset of X with sum exactly S ? k-Color: Given a graph G , is there a proper k-coloring? In other words, can we assign one of the k colors to each node such that no node is adjacent to a node of the same color? 1...
View Full Document
- Fall '08