An improved algorithm for finding maximum outerplanar subgraphs
From MaRDI portal
Publication:6184327
DOI10.1016/J.DAM.2023.08.009arXiv2306.05588OpenAlexW4387149517MaRDI QIDQ6184327
Author name not available (Why is that?)
Publication date: 24 January 2024
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2306.05588
No records found.
No records found.
This page was built for publication: An improved algorithm for finding maximum outerplanar subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184327)
