2 papers
cs.CG2019
Degree Bounded Bottleneck Spanning Trees in Three Dimensions
Patrick J. Andersen, Charl J. Ras
The geometric -minimum spanning tree problem (-MST) is the problem of finding a minimum spanning tree for a set of points in a normed vector space, such that no vertex in the…
math.CO2018
Algorithms for Euclidean Degree Bounded Spanning Tree Problems
Patrick J. Andersen, Charl J. Ras
Given a set of points in the Euclidean plane, the Euclidean \textit{-minimum spanning tree} (-MST) problem is the problem of finding a spanning tree with maximum degree no mo…