A New Bound for the 2-Edge Connected Subgraph Problem


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)
DOI: 10.1007/3-540-69346-7_9


Figures and Tables

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


Citations per Year

Citation Velocity: 6

Averaging 6 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics