Degree bounded geometric spanning trees with a bottleneck objective function

Authors

Keywords:

inimum spanning trees, bottleneck objective, approximation algorithms, discrete geometry, bounded degree, combinatorial optimization

Abstract

DOI: 10.1017/S0004972719001126

Published

2019-12-28

Issue

Section

Abstracts of PhD Theses