层次分析法建模-ResearchGate.pptVIP

Hawaii, US. Dec. 18-20, 2010 * Mingyu XiaoUniversity of Electronic Science and Technology of China Chengdu, China On a generalization of Nemhauser and Trotters local optimization theorem ISAAC2015, Nagoya Japan Dec. 9-11, 2015 * The Vertex Cover Problem (VC) A vertex set S in a graph is a vertex cover if each edge in the graph has at least one endpoint in S. VC: to find a vertex cover of minimum size. The vertex cover problem is one of the most fundamental NPC problems. * Nemhauser and Trotter’ Theorem NT-Theorem for the vertex cover problem:A theorem to reduce size of the instances G G’ I C Deleted parts NT-Theorem:A polynomial time algorithm to compute vertex subsets C and I of G such that for any minimum vertex cover K of G’=G[V - (C U I)], it holds1. K U C is a minimum vertex cover of G; and 2. * Nemhauser and Trotter’ Theorem A famous result in graph theory; Can get a 2-approximation algorithm for VC; Can get a 2k-vertex kernel for VC; There are several generalizations of NT theorem; …… One generalization: Similar results for another basic graph problem—the bounded-degree vertex deletion problem (BDD) * Bounded-Degree Vertex Deletion (BDD) A vertex set in a graph is called a d-degree deletion set if the removal of it makes the maximum degree of the remaining graph at most d. BDD: to find a d-degree deletion set of minimum size. Some special cases: d=0 Vertex Cover d=1 3-path Vertex Cover or Dissociation Set d=2 Co-path/cycle Are there any local optimization theorem for BDD similar to NT-theorem? * A Generalization of NT’ Theorem To reduce the instance of BDD: Poly-time to compute vertex subsets C and I of G such that for any minimum d-degree deletion set K of G’=G[V - (C U I)], it holds1. K U C is a minimum d-degree deletion set of G; and 2. G G’ I C Deleted parts (K’ is a solution to G’) [Fellows, Guo, Moser and Niedermeier, STACS 2009] proof is incomplete * A Generalization of NT’ Theorem Poly-time to comput