11approx-alg算法设计与分析 近似算法.pdfVIP

/287 1 Chapter 11 Approximation Algorithms Slides by Kevin Wayne, modified by Rasmus Pagh Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 2 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says youre unlikely to find a poly-time algorithm. Must sacrifice one of three desired features.   Solve problem in poly-time.   Solve arbitrary instances of the problem.   Solve problem to optimality. ρ-approximation algorithm.   Guaranteed to run in poly-time.   Guaranteed to solve arbitrary instance of the problem   Guaranteed to find solution within ratio ρ of true optimum. Challenge. Need to prove a solutions value is close to optimum, without even knowing what optimum value is! 3 11.1 Load Balancing Load Balancing Input. m identical machines; n jobs, job j has processing time t . j   Job j must run contiguously on one machine.   A machine can process at most one job at a time. Def. Let J(i) be the subset of jobs assigned to machine i. The load of machine i is L = Σ t . i j ∈ J(i) j Def. The makespan is the maximum load on any machine L = max L . i i Load balancing. Assign each job to a machine to minimize makespan. A B C D E F