CSI4105, Winter 2002, Approximation Algorithms Homework Assignment#3 (100 points, weight 10%) due: Thursday, November 28, at 10:00 a.m. (in lecture) Question 1: Problem 35-1 Bin Packing (pages: 1049-1050) Parts: b,c,d,e,f Question 2: Problem 35-4 Maximum Matching (page 1051) Parts: a, b, c, d, e, f The weight for each part will be announced here later on.