A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Minimum 2-vertex-twinless connected spanning subgraph problem
[article]

2020
*
arXiv
*
pre-print

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.

arXiv:2001.03788v1
fatcat:dfud4aze7zempdiaxd5bdn23tu