Problem 1 True or False

5 points 1a) the Set Cover problem is a special case of ILP

5 points 1b) ILP is known to be in P

5 points 1c) A polynomial time algorithm that solves an NP-complete problem exactly for most instances of that problem would be big news.

5 points 1d) A polynomial time algorithm that solves an NP-complete problem approximately on all inputs would be big news.

True

False, ILP is NP-hard

False … SAT is a known example

False … Knapsack (Jian’s talk) is an example

Previous slide

Next slide

Back to first slide

View graphic version