Patrick J. Andersen

activity

20142019

most citedMinimum Weight Resolving Sets of Grid Graphs

3 citations · 3 across the 1 of their papers we have counts for

collaborators

3 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…

math.CO2014★ 3 cited

Minimum Weight Resolving Sets of Grid Graphs

Patrick Andersen, Cyriac Grigorious, Mirka Miller

For a simple graph $G = (V, E)$ and for a pair of vertices $u, v \in V$ , we say that a vertex $w \in V$ resolves $u$ and $v$ if the shortest path from $w$ to $u$ is of a different leng…