Beth Spellman Munson

Learn More
We consider the problem of constructing a minimum-weight, two-connected network spanning all the points in a set V. We assume a symmetric, nonnegative distance function d ( ' ) defined on V x V which satisfies the triangle inequality. We obtain a structural characterization of optimal solutions. Specifically, there exists an optimal two-connected solution(More)
  • 1