DeepAI AI Chat
Log In Sign Up

Minimum 2-vertex-twinless connected spanning subgraph problem

by   Raed Jaberi, et al.

Given a 2-vertex-twinless connected directed graph G=(V,E), the minimum 2-vertex-twinless connected spanning subgraph problem is to find a minimum cardinality edge subset E^t⊆ E such that the subgraph (V,E^t) is 2-vertex-twinless connected. Let G^1 be a minimal 2-vertex-connected subgraph of G. In this paper we present a (2+a_t/2)-approximation algorithm for the minimum 2-vertex-twinless connected spanning subgraph problem, where a_t is the number of twinless articulation points in G^1.


page 1

page 2

page 3

page 4


An Improved Approximation Algorithm for the Minimum k-Edge Connected Multi-Subgraph Problem

We give a randomized 1+√(8ln k/k)-approximation algorithm for the minimu...

p-Edge/Vertex-Connected Vertex Cover: Parameterized and Approximation Algorithms

We introduce and study two natural generalizations of the Connected Vert...

Minimum T-Joins and Signed-Circuit Covering

Let G be a graph and T be a vertex subset of G with even cardinality. A ...

Minimum degree conditions for containing an r-regular r-connected subgraph

We study optimal minimum degree conditions when an n-vertex graph G cont...

Improved Approximation for Two-Edge-Connectivity

The basic goal of survivable network design is to construct low-cost net...

Small Connected Planar Graph with 1-Cop-Move Number 4

This paper describes a 720-vertex connected planar graph G such that cop...

Approximating Connected Safe Sets in Weighted Trees

For a graph G and a non-negative integral weight function w on the verte...