Martin Berlakovich. Multilevel Heuristiken für das Rooted Delay-Constrained Minimum Spanning Tree Problem. July 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. (Note: supervised by G.~Raidl and M.~Ruthmair)