DeepAI

# Minimum 2-vertex-twinless connected spanning subgraph problem

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.

01/15/2021

### 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...
09/17/2020

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

We introduce and study two natural generalizations of the Connected Vert...
03/09/2018

### Minimum T-Joins and Signed-Circuit Covering

Let G be a graph and T be a vertex subset of G with even cardinality. A ...
08/17/2021

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

We study optimal minimum degree conditions when an n-vertex graph G cont...
09/21/2022

### Improved Approximation for Two-Edge-Connectivity

The basic goal of survivable network design is to construct low-cost net...
12/15/2019

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

This paper describes a 720-vertex connected planar graph G such that cop...
11/30/2017

### Approximating Connected Safe Sets in Weighted Trees

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