Dirk Bongartz

Learn More
In this paper we investigate the problem of finding a 2-connected spanning subgraph of minimal cost in a complete and weighted graph G. This problem is known to be APX-hard, for both the edge and the vertex connectivity case. Here we prove that the APX-hardness still holds even if one restricts the edge costs to an interval [1, 1 + ε], for an arbitrary(More)
a r t i c l e i n f o a b s t r a c t The k-connectivity problem is to find a minimum-cost k-edge-or k-vertex-connected spanning subgraph of an edge-weighted, undirected graph G for any given G and k. Here, we consider its NP-hard subproblems with respect to the parameter β, with 1 2 < β < 1, where G = (V , E) is a complete graph with a cost function c(More)
  • 1