Highly Influenced

Given a complete undirected graph with non negative costs on the edges the Edge Connected Subgraph Problem consists in nding the minimum cost spanning edge connected subgraph where multi edges are allowed in the solution A lower bound for the minimum cost edge connected subgraph is obtained by solving the linear programming relaxation for this problem whichâ€¦Â (More)

Sorry, we couldn't extract any figures or tables for this paper.

Citations per Year

Averaging **6 citations** per year over the last 3 years.