# Degree Bounded Bottleneck Spanning Trees in Three Dimensions

## TL;DR

This paper studies the complexity and approximation of degree-bounded bottleneck spanning trees in three dimensions, extending known 2D results to 3D Euclidean and rectilinear spaces, and introduces new algorithms with performance analysis.

## Contribution

It proves NP-hardness and inapproximability for 3D $oldsymbol{ ext{MBST}}$ problems and develops new approximation algorithms with worst-case analysis.

## Key findings

- NP-hardness established for 3D $oldsymbol{ ext{MBST}}$ for certain $oldsymbol{ ext{}oldsymbol{ ext{delta}}}$ values
- Inapproximability results provided for these 3D problems
- New approximation algorithms with analyzed worst-case performance

## Abstract

The geometric $\delta$-minimum spanning tree problem ($\delta$-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 tree has a degree which exceeds $\delta$, and the sum of the lengths of the edges in the tree is minimum. The similarly defined geometric $\delta$-minimum bottleneck spanning tree problem ($\delta$-MBST), is the problem of finding a degree bounded spanning tree such that the length of the longest edge is minimum. For point sets that lie in the Euclidean plane, both of these problems have been shown to be NP-hard for certain specific values of $\delta$. In this paper, we investigate the $\delta$-MBST problem in $3$-dimensional Euclidean space and $3$-dimensional rectilinear space. We show that the problems are NP-hard for certain values of $\delta$, and we provide inapproximability results for these cases. We also describe new approximation algorithms for solving these $3$-dimensional variants, and then analyse their worst-case performance.