第19讲 approximation algorithms 算法导论课件教程教案.pptVIP

Illustration (b) A minimum spanning tree T of these points, as computed by MST-PRIM. Vertex a is the root vertex. The vertices happen to be labeled in such a way that they are added to the main tree by MST-PRIM in alphabetical order. Illustration (c) A walk of T , starting at a. A full walk of the tree visits the vertices in the order a, b, c, b, h, b, a, d, e, f, e, g, e, d, a. A preorder walk of T lists a vertex just when it is first encountered, as indicated by the dot next to each vertex, yielding the ordering a, b, c, h, d, e, f, g. Illustration (d) A tour of the vertices obtained by visiting the vertices in the order given by the preorder walk. This is the tour H returned by APPROX-TSP-TOUR. Its total cost is approximately 19.074. Illustration (e) An optimal tour H* for the given set of vertices. Its total cost is approximately 14.715. Traveling salesman problem with triangle inequality. root MST Pre-Order walk Hamiltonian Cycle * Theorem. APPROX-TSP-TOUR is a polynomial-time 2-approximation algorithm for the traveling-salesman problem with the triangle inequality. Proof of the traveling-salesman problem * Approximation Algorithm近似算法 * Approximation algorithmOptimal algorithm Approximation problem  * Why Approximation Algorithms Problems that we cannot find an optimal solution in a polynomial time Eg: Set Cover, Bin Packing Need to find a near-optimal solution: Heuristic Approximation algorithms: This gives us a guarantee approximation ratio * Why Approximation Algorithms There are at least three approaches to getting around NP-completeness. First, if the actual inputs are small, an algorithm with exponential running time may be perfectly satisfactory. Second, we may be able to isolate important special cases that are solvable in polynomial time. * Why Approximation Algorithms Third, it may still be possible to find near-optimal solutions in polynomial time (either in the worst case or on average). In practice, near-optimality is of