The algorithm computes a k-edge-connected spanning subgraph with cost no greater than the optimal (k+10)-edge-connected spanning subgraph.
