DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION

DOI10.1017/S0004972719001126zbMATH Open1434.90163OpenAlexW2937319000WikidataQ126989970 ScholiaQ126989970MaRDI QIDQ5212976FDOQ5212976

Patrick 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 algorithmscombinatorial optimisationminimum spanning treesbounded degreebottleneck objective

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212976)