1. CSE 6311 – Spring 2009 ADVANCED COMPUTATIONAL MODELS AND ALGORITHMS Lecture Notes – March 12, 2009 ILP – Integer Linear Programming Approximate algorithm for ILP Instructor: Dr. Gautam Das notes by Walter Wilson

2. ILP – Integer Linear Programming set of integer variables linear constraints linear goal function (same as LP except vars are integers)

3. Integer Linear Programming Example Factory productmaterialprofit Product1w1 grams metal per unitp1 dollars per unit Product2w2 "p2 " Constraints: total # of products per day <= P total amount of material per day <= W Unknowns: x1 - # of units of Product1 x2 - " Product2 Goal function: maximize profit: x1 p1 + x2 p2 Constraint equations: x1 + x2 <= P x1 w1 + x2 w2 <= W x1 >= 0, x2 >= 0, x1,x2 integers!

4. ILP Example 2 – Shortest Paths Given weighted directed graph and start, end nodes s & f, find weight of shortest path from start to end. Letwj >= 0 be integer weight for each edge j ui >= 0 be weight of shortest path from s to node ui Consider shortest path from s to node v: s u1 u2 w1 w2 v u1 u2 Shortest path to v in terms of path to preceding node uk: v <= uk + wk (edge (uk,v) has weight wk) v >= 0 Goal: minimize f (shortest path to f)

5. ILP Decision Problem Is there a var asnmt s.t. goal =0, xi = 1 goal: minimize sum of xi -- xi == 1 means xi selected for vertex cover -- goal <= k means V.C. <= k

6. Approximation Algorithm for ILP Vertex Cover Algorithm: –Treat as LP problem Will get values 0.0 to 1.0 for vertices (VChypoth) –VChypoth <= VCopt – LP solution more optimal than ILP One possible algorithm: take vertices in decreasing order –Stop when cover achieved Simpler: round to 0 or 1 (.5 rounds up) –Is this a vertex cover? »Yes since sum of values for each edge >= 1 –Approximation bound: »VChypoth = sum of x's =.5 »(left vars round to 0, right round to 1) »VCapprox = sum of rounded vars <= 2 * unrounded »Thus: VCapprox <= 2 * VChypoth »Thus: VCapprox <= 2 * VCopt

7. Weighted Vertex Cover Graph with weighted nodes Find vertex cover that touches all edges but minimizes the sum of the weights ILP problem –Goal: sum i=1..n xi wi –How to do rounding? -- do same way –How to prove approximation ratio? VCapprox <= 2 VCopt