The $2$-connected bottleneck Steiner network problem is NP-hard in any ${\ell }_p$ plane

M Brazil, C Ras, D Thomas +1

Bottleneck Steiner networks model energy consumption in wireless ad-hoc networks. The task is to design a network spanning a given set of terminals and at most $k$ Steiner points s…