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.

翻译：我们研究NP完全的最大外平面子图问题。该问题先前已知的最佳近似比为2/3。我们提出一种新的近似算法，将近似比提升至7/10。