Patrick Andersen

Degree bounded bottleneck spanning trees in three dimensions

Patrick J Andersen, Charl J Ras

Journal article  |  2020  |  Journal of Combinatorial Optimization

Algorithms for Euclidean Degree Bounded Spanning Tree Problems

PJ Andersen, CJ Ras

Journal article  |  2019  |  International Journal of Computational Geometry & Applications

Given a set of points in the Euclidean plane, the Euclidean [Formula: see text]-minimum spanning tree ([Formula: see text]-MST) pr..

Degree bounded geometric spanning trees with a bottleneck objective function

Patrick Andersen

Thesis / Dissertation  |  2019

We introduce the geometric $\delta$-minimum bottleneck spanning tree problem ($\delta$-MBST), which is the problem..

Minimum Bottleneck Spanning Trees with Degree Bounds

Patrick J Andersen, Charl J Ras

Journal article  |  2016  |  Networks

Minimum weight resolving sets of grid graphs

Patrick Andersen, Cyriac Grigorious, Mirka Miller

Journal article  |  2016  |  Discrete Mathematics, Algorithms and Applications

For a simple graph [Formula: see text] and for a pair of vertices [Formula: see text], we say that a vertex [Formula: see text] re..