加载中…
2023-06-08
An Improved Algorithm for Finding Maximum Outerplanar Subgraphs
Gruia CalinescuHemanshu KaulBahareh Kudarzi
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本