
An Improved Approximation Algorithm for the Minimum kEdge Connected MultiSubgraph Problem
We give a randomized 1+√(8ln k/k)approximation algorithm for the minimu...
read it

pEdge/VertexConnected Vertex Cover: Parameterized and Approximation Algorithms
We introduce and study two natural generalizations of the Connected Vert...
read it

Minimum TJoins and SignedCircuit Covering
Let G be a graph and T be a vertex subset of G with even cardinality. A ...
read it

Minimum degree conditions for containing an rregular rconnected subgraph
We study optimal minimum degree conditions when an nvertex graph G cont...
read it

Small Connected Planar Graph with 1CopMove Number 4
This paper describes a 720vertex connected planar graph G such that cop...
read it

Approximating Connected Safe Sets in Weighted Trees
For a graph G and a nonnegative integral weight function w on the verte...
read it

Physical ZeroKnowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle
An undirected graph G is known to both the prover P and the verifier V, ...
read it
Minimum 2vertextwinless connected spanning subgraph problem
Given a 2vertextwinless connected directed graph G=(V,E), the minimum 2vertextwinless connected spanning subgraph problem is to find a minimum cardinality edge subset E^t⊆ E such that the subgraph (V,E^t) is 2vertextwinless connected. Let G^1 be a minimal 2vertexconnected subgraph of G. In this paper we present a (2+a_t/2)approximation algorithm for the minimum 2vertextwinless connected spanning subgraph problem, where a_t is the number of twinless articulation points in G^1.
READ FULL TEXT
Comments
There are no comments yet.