Approximation Algorithm for the Maximum Independent Set Problem in Cubic Planar Graphs

摘要

A polynomial time approximation algorithm A for the problem of finding a maximal independent set for cubic planar graphs is presented. It is shown that M sub A > 6/7 in the case of cubic planar graphs and M sub A = 7/8 in the case of triangle free cubic planar graphs where M sub A is the worst-case ratio of the size of the independent set found by A to the size of the maximum independent set the graph input to A.