Back to Search
Start Over
An improved algorithm for finding maximum outerplanar subgraphs.
- Source :
-
Discrete Applied Mathematics . Jan2024, Vol. 342, p207-217. 11p. - Publication Year :
- 2024
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *SUBGRAPHS
*APPROXIMATION algorithms
*ALGORITHMS
Subjects
Details
- Language :
- English
- ISSN :
- 0166218X
- Volume :
- 342
- Database :
- Academic Search Index
- Journal :
- Discrete Applied Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 173860011
- Full Text :
- https://doi.org/10.1016/j.dam.2023.08.009