Subgraphs decomposable into two trees and k-edge-connected subgraphs Original Research Article

Given a complete graph with edge weights that satisfy the triangle inequality, we bound the minimum cost of a subgraph which is the union of two spanning trees in terms of the minimum cost of a k-edge-connected subgraph, for k⩽4.