Survivable minimum bottleneck networks (Q904084)

The author studies the problem of constructing survivable minimum bottleneck networks in normed (Minkowski) planes and presents the polynomial time algorithm for the survivable bottleneck Steiner network problem in normed planes. The method presented is applicable in any normed plane as long as a few basic operations, such as finding the intersection of two unit balls, can be performed in constant time. These results provide a significant extension of earlier works for 1-and 2-connected bottleneck networks (see [\textit{S. W. Bae} et al., Algorithmica 61, No. 4, 924--948 (2011; Zbl 1230.68203)] and [\textit{M. Brazil} et al., Discrete Appl. Math. 160, No. 7--8, 1028--1038 (2012; Zbl 1243.05064)]).