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
Hauptverfasser: Calinescu, Gruia, Kaul, Hemanshu, Kudarzi, Bahareh
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Data Structures and Algorithms
Mathematics - Combinatorics
Online-Zugang:Volltext bestellen
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.
DOI:10.48550/arxiv.2306.05588