Minimum bottleneck spanning trees with degree bounds

DOI10.1002/NET.21710MaRDI QIDQ4642403zbMATH OpenOpenAlexFDO

Authors Patrick Andersen, C. 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

approximation algorithmsbottleneck objectivebounded degreecombinatorial optimizationdiscrete geometryminimum spanning trees

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• Degree bounded bottleneck spanning trees in three dimensions
• Algorithms for Euclidean degree bounded spanning tree problems
• Degree-bounded minimum spanning trees
• Euclidean bottleneck bounded-degree spanning tree ratios
• Low-Degree Spanning Trees of Small Weight

Cited in

(17)

• Degree-bounded minimum spanning trees
• The vertex degrees of minimum spanning trees
• Upgrading min-max spanning tree problem under various cost functions
• Approximation schemes for degree-restricted MST and red-blue separation problems
• Euclidean bottleneck bounded-degree spanning tree ratios
• On minimum leaf spanning trees and a criticality notion
• Degree bounded bottleneck spanning trees in three dimensions
• The complexity of symmetric connectivity in directional wireless sensor networks
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES
• scientific article; zbMATH DE number 2038709 (Why is no real title available?)
• Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
• Algorithms for Euclidean degree bounded spanning tree problems
• DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION
• Minimum Spanning Tree with Neighborhoods
• scientific article; zbMATH DE number 7662164 (Why is no real title available?)
• Improved algorithms in directional wireless sensor networks
• Degree-bounded minimum spanning tree for unit disk graph

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

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