Approximation Algorithm课件.pptVIP

Approximation Algorithm; Dealing with Hard Problems ;Dealing with Hard Problems ;Traveling Salesman Problem ; The vertex-cover problem ;Dealing with Hard Problems ; Approximation Algorithms;Comments on Approximation ; ; The vertex-cover problem ;Naive Algorithm;Illustration of Naive algorithm;Approximation 2; Vertex cover: summary; The Traveling Salesman Problem ; 2-approximation for TSP  with triangle inequality ;Algorithm ; Preorder Traversal ;Illustration ;2-approximation;Load Balancing;List-scheduling algorithm. Consider n jobs in some fixed order. Assign job j to machine whose load is smallest so far. Implementation. O(n log n) using a priority queue.;Load Balancing: List Scheduling Analysis;Load Balancing: List Scheduling Analysis;Load Balancing: List Scheduling Analysis;Load Balancing: List Scheduling Analysis;Load Balancing: List Scheduling Analysis;Machine 2;Load Balancing: LPT Rule;Load Balancing: LPT Rule;Load Balancing: LPT Rule;LPT; Approximation Scheme; PTAS and FPTAS;The Subset Sum ;An exponential-time exact algorithm;Exact algorithm;Example; The Subset-sum problem: FPTAS;Example; (1+ ∈)-Approximation algorithm;FPTAS;Pf. Con.;Pf. Con.;Pf. Con.