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

The Analysis and Design of Approximation Algorithms for the Maximum Induced Planar Subgraph Problem Kerri Morgan Supervisor: Dr. G. Farr Overview Definitions Maximum Induced Planar Subgraph problem Why? Project Aims Algorithms Achievements and Summary Definitions – Planar Graph MIPSMaximum Induced Planar Subgraph problem What is the size of the largest subset of vertices such that the induced subgraph is planar? NP-hard Approximation algorithms Planarity Project Aims Implement existing algorithms Develop and implement new algorithms Observe behaviour on randomly generated graphs Perform some mathematical analysis Existing MIPS Approximation Algorithms Graphs of Average Degree dVertex Removal Algorithm (Edwards Farr) Lower Bound: 3/(d+1) d=3 Bound is 3/4 d=5 Bound is 1/2 Modifications to Existing Algorithms Hybrid Combines Vertex Addition and Vertex Removal Algorithms Vertex Subset Removal Introduces a more careful ordering of vertices selected for removal in the Vertex Removal Algorithm MIPS Algorithms Related Algorithms Maximal Independent Set Maximal Induced Forest New Algorithms Palm Trees Large Outerplanar Induced Subgraph Beyond Outerplanar Subgraphs Independent Set Subgraph contains no edges Lower Bound: 1/(d+1) Induced Forests Subgraph contains no cycles Lower Bound: 2/(d+1) Maximal Induced Forests Palm Trees ‘Growing’ Palm Trees From Trees Outerplanar Graphs No Removal of Vertices Lower bound at least as large as Palm Trees Not necessarily maximal Performs better than Vertex Addition algorithm in practice Comparison Partitioning Vertex Addition Vertex Removal Independent Set Forest Palm Tree Outerplanar Beyond Outerplanar Component-wise Decisions Vertex has no neighbours in the component Vertex has one neighbour in the component All neighbours lie on the same face Extend Algorithm Extends a planar subgraph Produces a more complex planar subgraph Used to extend subgraphs produced by the following algorithms: Outerplanar