z-Approximations.ppt

z-Approximations Refael Hassin Samir Khuller Introduction 傳統分析方法 傳統分析方法的困境 新的分析方法 傳統分析方法 OPT 是針對NP problem的最佳解. C 假設是我們approximation algo. 所求的cost. 求最大值 C = (1-?)*OPT (0 ?1) 求最小值 C = (1+?)*OPT (0 ?1) 傳統分析方法的困境 不好的approximation會被以為是好的approximation,像vertex cover,用maximum matching找到的有可能是所有的vertices. 有些NP的問題用傳統方法會找不到?-approximation,像 generic TSP,如果找的到的話,則NP=P. 新的分析方法 以前都是跟最佳解來做比較,看是否能在最佳解的 ? 倍以內. (0 ?1) 假設我們可以找到一個best sol’n跟一個worst sol’n,則我們的approximation algo.所產生的cost是用來跟best sol’n的cost跟worst sol’n的cost間來比較,則這是我們新的評估方法. z-Approximation (新的分析法) 以求最大值為例 worst sol’n OPT best z-Approximation for minimization problems c(S)是我們所求的一個解的cost c(best)是找出來的一個很好的解的cost c(worst)是找出來的一個很差的解的cost z-Approximation for maximization problems z-Approximation for some NP problems TSP ? z-Approximation for directed graph. 1/3 z-Approximation for undirected graph. Max cut and Min cluster ?(n/n-2) z-Approximation. (n是點的個數) Minimum disjoint cycle cover 1/3 z-Approximation Minimum dominating set ? z-Approximation ? z-approximation ~ Directed TSP Input : Directed Complete Graph G = (V, A) with weights c( i, j ) . Output : minimum cost simple cycle on V. Facts ~ Christofides ‘76 The well known algorithm which guarantee bounded ratio (3/2) approximations for the minimum (metric) TSP on undirected may still output worst solutions on such instances. Facts ~ Christofides ‘76 For example, consider a complete graph with unit length edges for all but a single edge whose length is two. Cycle cover Cycle Cover is a set of vertex disjoint cycles which span the vertex set. A minimum cost cycle cover can be computed in P-time in the directed case by reducing to the assignment problem. Algorithm Step 1 Compute a minimum cost directed cycle cover DCC. It contains a single cycle return this cycle (it is an optimal tour). Otherwise, arbitrarily fix a cyclic order of the cycles in DCC. Denote the cycles in the