Design and Analysis of Greedy Approximations贪婪逼近的设计与分析.pptVIP

Sufficiency Example of Matroid Proof Theorem Every independent system is an intersection of several matroids. circuit A minimal dependent set is called a circuit. Let A1, …, Ak be all circuits of independent system (E,C). Let Theorem If independent system (E,C) is the intersection of k matroids (E,Ci), then for any subset F of E, u(F)/v(F) k. Proof Applications Many combinatorial optimization problem can be represented as an intersection of matrods. (see Lawler: Combinatorial Optimization and Matroid.) Thanks, End Chapter 2 Greedy Strategy I. Independent System Ding-Zhu Du Max and Min Min f is equivalent to Max –f. However, a good approximation for Min f may not be a good approximation for Min –f. For example, consider a graph G=(V,E). C is a minimum vertex cover of G if and only if V-C is a maximum independent of G. The minimum vertex cover has a polynomial-time 2-approximation, but the maximum independent set has no constant-bounded approximation unless NP=P. Greedy for Max and Min Max --- independent system Min --- submodular potential function Independent System Consider a set E and a collection C of subsets of E. (E,C) is called an independent system if Maximization c: E→R max c(A) s.t. AεC c(A) = ΣxεA c(x) + Greedy Approximation MAX Theorem Proof Maximum Weight Hamiltonian Cycle Given an edge-weighted complete graph, find a Hamiltonian cycle with maximum total weight. Independent sets E = {all edges} A subset of edges is independent if it is a Hamiltonian cycle or a vertex-disjoint union of paths. Maximal Independent Sets Consider a subset F of edges. For any two maximal independent sets I and J of F, |J| 2|I| Maximum Weight Directed Hamiltonian Cycle Given an edge-weighted complete digraph, find a Hamiltonian cycle with maximum total weight. Independent sets E = {all edges} A subset of edges is independent if it is a directed Hamiltonian cycle or a vertex-disjoint union of dire