AI Chat AI Image Generator AI Video Text to Speech

An Improved Algorithm for Finding Maximum Outerplanar Subgraphs

06/08/2023
∙
by   Gruia Calinescu, et al.
∙
0
∙

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.

READ FULL TEXT

Related Research

research
∙ 03/06/2023

A Simple 2-Approximation for Maximum-Leaf Spanning Tree

For an m-edge connected simple graph G, finding a spanning tree of G wit...
0 I-Cheng Liao, et al. ∙
research
∙ 01/22/2019

A (4+ε)-approximation for k-connected subgraphs

We obtain approximation ratio 2(2+1/ℓ) for the (undirected) k-Connected ...
0 Zeev Nutov, et al. ∙
research
∙ 01/03/2021

Computing Cliques and Cavities in Networks

Complex networks have complete subgraphs such as nodes, edges, triangles...
0 Dinghua Shi, et al. ∙
research
∙ 06/02/2023

The Maximum Matrix Contraction Problem

In this paper, we introduce the Maximum Matrix Contraction problem, wher...
0 Dimitri Watel, et al. ∙
research
∙ 09/10/2018

Computational Aspects of Optimal Strategic Network Diffusion

The diffusion of information has been widely modeled as stochastic diffu...
0 Marcin Waniek, et al. ∙
research
∙ 04/29/2020

Planted Models for the Densest k-Subgraph Problem

Given an undirected graph G, the Densest k-subgraph problem (DkS) asks t...
0 Yash Khanna, et al. ∙
research
∙ 09/21/2020

Distributed Algorithms for Matching in Hypergraphs

We study the d-Uniform Hypergraph Matching (d-UHM) problem: given an n-v...
0 Oussama Hanguir, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal