An Improved Algorithm for Finding Maximum Outerplanar Subgraphs
arXiv:2306.05588
Abstract
We study the NP-complete Maximum Outerplanar Subgraph problem. The previous best known approximation ratio for this problem is 2/3. We propose a new approximation algorithm which improves the ratio to 7/10.