Minimum bottleneck spanning trees with degree bounds

DOI10.1002/net.21710zbMath1390.90088OpenAlexW2523915986MaRDI QIDQ4642403

Patrick J. Andersen, Charl J. Ras

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11343/291785

zbMATH Keywords

combinatorial optimizationdiscrete geometryapproximation algorithmsminimum spanning treesbounded degreebottleneck objective

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (7)

Upgrading min-max spanning tree problem under various cost functions ⋮ Improved algorithms in directional wireless sensor networks ⋮ Algorithms for Euclidean Degree Bounded Spanning Tree Problems ⋮ Degree bounded bottleneck spanning trees in three dimensions ⋮ DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION ⋮ The complexity of symmetric connectivity in directional wireless sensor networks ⋮ Euclidean bottleneck bounded-degree spanning tree ratios

This page was built for publication: Minimum bottleneck spanning trees with degree bounds