Degree bounded geometric spanning trees with a bottleneck objective function

P. J. Andersen


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

Remember, for most actions you have to record/upload into OJS
and then inform the editor/author via clicking on an email icon or Completion button.
Bulletin of the Aust. Math. Soc., copyright Australian Mathematical Publishing Association Inc.