Simple Length-Constrained Minimum Spanning Trees

D Ellis Hershkowitz, Richard Z Huang

In the length-constrained minimum spanning tree (MST) problem, we are given an $n$-node edge-weighted graph $G$ and a length constraint $h\ge 1$. Our goal is to find a spanning t…