Define the Algorithm

• Different algorithms are defined and used.
• Every algorithm has some unique latency and depth calculations.
• The DBSPT algorithm is defined.

Here we present a new heuristic algorithm, called DBSPT, that improves upon previous solutions, both in terms of empirical evaluation and theoretical worst-case approximation factors for degree and depth-bounded minimum average-latency spanning trees. We present an empirical analysis in which we compare our DBSPT algorithm against other solutions to the problem including the KLS algorithm, OMNI, and MDDBST. Our algorithm consistently outperforms all previous algorithms when we consider the combined product measure of average-latency times the maximum depth