(精选)Approximation Algorithm Iterative Rounding教学课件.pptVIP

min ?e2 E ce xe s.t. ?e2 E(V) xe= |V|-1 ?e2 E(S) xe ≤ |S|-1 xe ≥ 0 Spanning Tree Polytope Recall: A vertex solution is the unique solution of m linearly independent tight inequalities, where m denotes the number of variables. min ?e2 E ce xe s.t. ?e2 E(V) xe= |V|-1 ?e2 E(S) xe ≤ |S|-1 xe ≥ 0 Spanning Tree Polytope If there is an edge of 0, delete it. If there exists a leaf vertex v, then include the edge incident at v in and remove v from G. Approximation Algorithm: Iterative Rounding Lecture 15: March 9 Lower bound and Approximation Algorithm The key of designing a polytime approximation algorithm is to obtain a good (lower or upper) bound on the optimal solution. For NP-complete problem, we can’t compute an optimal solution in polytime. The general strategy (for a minimization problem) is: lowerbound OPT SOL SOL ≤ c · lowerbound ? SOL ≤ c · OPT lowerbound OPT SOL To design good approximation algorithm, we need a good lowerbound. For example, if 100 · lowerbound ≤ OPT for some instance, then if we compare SOL to lowerbound to analyze the performance, we could not achieve anything better than an 100-approximation algorithm. Lower bound and Approximation Algorithm lowerbound OPT SOL Goal: to find a lowerbound as close to OPT as possible. Lower bound and Approximation Algorithm In metric TSP and the minimum Steiner tree problem, we use minimum spanning tree as a lowerbound. In general, it is often difficult to come up with a good lowerbound. Linear Programming and Approximation Algorithm lowerbound OPT SOL Linear programming: a general method to compute a lowerbound in polytime. LP To computer an approximate solution, we need to return an (integral) solution close to an optimal LP (fractional) solution. An Example: Vertex Cover Vertex cover: find an minimum subset of vertices which cover all the edges. A linear programming relaxation of the vertex cove