The bottleneck 2-connected k-Steiner network problem for k≤2

@article{Brazil2012TheB2,
  title={The bottleneck 2-connected k-Steiner network problem for k≤2},
  author={Marcus Brazil and Charl J. Ras and Doreen A. Thomas},
  journal={Discrete Applied Mathematics},
  year={2012},
  volume={160},
  pages={1028-1038}
}
The geometric bottleneck Steiner network problem on a set of vertices X embedded in a normed plane requires one to construct a graph G spanning X and a variable set of k ≥ 0 additional points, such that the length of the longest edge is minimised. If no other constraints are placed on G then a solution always exists which is a tree. In this paper we consider the Eu-clidean bottleneck Steiner network problem for k ≤ 2, where G is constrained to be 2-connected. By taking advantage of relative… CONTINUE READING