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.
@article{arxiv.2306.05588,
title = {An Improved Algorithm for Finding Maximum Outerplanar Subgraphs},
author = {Gruia Calinescu and Hemanshu Kaul and Bahareh Kudarzi},
journal= {arXiv preprint arXiv:2306.05588},
year = {2023}
}