An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-06
Hauptverfasser: Calinescu, Gruia, Kaul, Hemanshu, Kudarzi, Bahareh
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Mathematical analysis
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422