Lectures onNP-hard problems andApproximation algorithms.pptVIP

* * * * * * * * * * * * * * * * * * * NP-hard problems and Approximation algorithms * Approximation algorithms Having an NP-hard problem, we do not know in this moment any polynomial-time algorithm solving the problem (exact solution) How to find almost optimal solution? Approximation algorithm with ratio a 1 gives a solution A such that OPT ? A ? a ? OPT for a min-optimization problems OPT/a ? A ? OPT for a max-optimization problems where OPT is an optimal solution. NP-hard problems and Approximation algorithms * 2-approximation for VC Minimum Vertex Cover - NP-hard problem even for all weights = 1 (maximum is trivially n) Algorithm: (for all weights equal to 1) Initialize set C to empty set While there are remaining edges: Choose an edge {v,w} (with the largest degree, where degree of an edge is a sum of degrees of its ends v,w in a current graph G ) Put v,w to C Remove all the edges adjacent to nodes v,w from graph G Output: witness set C and its size NP-hard problems and Approximation algorithms * Integer Programming Represent the problem as Integer Programming Relax the problem to Linear Programming Solve Linear Programming Round the solution to get integers NP-hard problems and Approximation algorithms * Integer and linear programs Set of constraints (linear equations): x1 , x2 ? 0 x1 + 2x2 ? 6 2x1 + x2 ? 6 Function to minimize (linear): 4x1 + 3x2 Linear programming: variables are real numbers there are polynomial time algorithms solving it (e.g., interior point method - by N. Karmarkar in 1984); simplex method is not polynomial Integer programming: variables are integers problem is NP-hard NP-hard problems and Approximation algorithms * VC as Integer Program Set of constraints : xi ? {0,1} for every node i xi + xj ? 1 for every pair {i,j} ? E Function to minimize: ?i xiwi Example: x1 , x2 , x3 , x4 ? {0,1} x1 + x3 ? 1 , x1 + x4 ? 1 , x2 + x4 ? 1 , x2 + x3 ? 1 Minimize: x1 + x2 + x3 + x4 x1 x2 x3 x4 NP-hard