19 citations · 39 across the 14 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
The -connected bottleneck Steiner network problem is NP-hard in any 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 Steiner points s…
cs.NI2019★ 13 cited
The Fast Heuristic Algorithms and Post-Processing Techniques to Design Large and Low-Cost Communication Networks
Yahui Sun, Marcus Brazil, Doreen Thomas +1
It is challenging to design large and low-cost communication networks. In this paper, we formulate this challenge as the prize-collecting Steiner Tree Problem (PCSTP). The objectiv…