算法设计与分析算法设计与分析 (13).pptxVIP

Chapter 12 Local Search Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says youre unlikely to find poly-time algorithm. Must sacrifice one of three desired features. n Solve problem to optimality. n Solve problem in polynomial time. n Solve arbitrary instances of the problem. Coping With NP-Hardness 2 12. 1 Landscape of an Optimization Problem Gradient Descent : Vertex Cover VERTEX-COVER. Given a graph G = (V, E), find a subset of nodes S of minimal cardinality such that for each u-v in E, either u or v (or both) are in S. Neighbor relation. S S if S can be obtained from S by adding or deleting a single node. Each vertex cover S has at most n neighbors. Gradient descent. Start with S = V. If there is a neighbor S that is a vertex cover and has lower cardinality, replace S with S. Remark. Algorithm terminates after at most n steps since each update decreases the size of the cover by one. 4 optimum = all nodes on left side local optimum = all nodes on right side optimum = even nodes local optimum = omit every third node Local optimum. No neighbor is strictly better. optimum = center node only local optimum = all other nodes Gradient Descent : Vertex Cover 5 Local Search Local search. Algorithm that explores the space of possible solutions in sequential fashion, moving from a current solution to a nearby one. Neighbor relation. Let S S be a neighbor relation for the problem. Gradient descent. Let S denote current solution. If there is a neighbor S of S with strictly lower cost, replace S with the neighbor whose cost is as small as possible. Otherwise, terminate the algorithm. A jagged funnel A funnel 6 12.4 Maximum Cut Toy application. n n activities, m people. n Each person wants to participate in two of the activities. n Schedule each activity in the morning or afternoon to m