退一步海阔天空精品.pptVIP

退一步海闊天空---淺談「近似演算法」;全省走透透;Traveling Salesman Problem;2;How hard is this problem?;How hard is NP-hard?;That is, …;On the bright side…;CMI Millennium Prize;NP-completeness = Dead end ?;退一步 海闊天空;Traveling Salesman Problem;近似演算法的哲學;安徽省 桐城 西後街?百子堂;【桐城縣誌略】;近似演算法的哲學;Example 1;Vertex Cover Problem;Illustration;The Vertex Cover Problem is also NP-hard…;Vertex Cover Problem;An approximation algorithm for the vertex cover problem;Illustration;Three questions;Q1: feasibility?;Q2: tractability?;Q3: Quality?;Such an algorithm is called a 2-approximation for vertex cover problem;Approximation Algorithm;Ca