19 citations · 52 across the 15 of their papers we have counts for
4 papers · 1 filter
A Flow-dependent Quadratic Steiner Tree Problem in the Euclidean Plane
Marcus Brazil, Charl Ras, Doreen Thomas
We introduce a flow-dependent version of the quadratic Steiner tree problem in the plane. An instance of the problem on a set of embedded sources and a sink asks for a directed tre…
An exact algorithm for the bottleneck 2-connected -Steiner network problem in planes
Marcus Brazil, Charl Ras, Doreen Thomas
We present the first exact polynomial time algorithm for constructing optimal geometric bottleneck 2-connected Steiner networks containing at most Steiner points, where i…
Generalised k-Steiner Tree Problems in Normed Planes
Marcus N. Brazil, Charl J. Ras, Konrad J. Swanepoel +1
The 1-Steiner tree problem, the problem of constructing a Steiner minimum tree containing at most one Steiner point, has been solved in the Euclidean plane by Georgakopoulos and Pa…
The bottleneck 2-connected -Steiner network problem for
M. Brazil, C. J. Ras, D. A. Thomas
The geometric bottleneck Steiner network problem on a set of vertices embedded in a normed plane requires one to construct a graph spanning and a variable set of $k\geq…