4 citations · 9 across the 32 of their papers we have counts for
1 paper · 1 filter
Gruia Calinescu, Hemanshu Kaul, Bahareh 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 i…