DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION

DOI10.1017/S0004972719001126zbMath1434.90163OpenAlexW2937319000WikidataQ126989970 ScholiaQ126989970MaRDI QIDQ5212976

Patrick J. Andersen

Publication date: 31 January 2020

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972719001126

zbMATH Keywords

discrete geometryapproximation algorithmsminimum spanning treescombinatorial optimisationbounded degreebottleneck objective

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Degree bounded bottleneck spanning trees in three dimensions
• Minimum bottleneck spanning trees with degree bounds
• Algorithms for Euclidean Degree Bounded Spanning Tree Problems