The Analysis and Design of Approximation Algorithms for the 为分析与近似算法的计.pptVIP

The Analysis and Design of Approximation Algorithms for the Maximum Induced Planar Subgraph Problem;Overview;Definitions – Planar Graph;Definitions - Planarisation;MIPSMaximum Induced Planar Subgraph problem;Planarity;Project Aims;Existing MIPS Approximation Algorithms;Modifications to Existing Algorithms; MIPS Algorithms;Independent Set;Induced Forests;Maximal Induced Forests;Palm Trees;‘Growing’ Palm Trees From Trees;Outerplanar Graphs;Comparison;Beyond Outerplanar;Component-wise Decisions;Extend Algorithm;Results;Speed v Size;Achievements and Summary;Achievements Summary;Further Work?;Q