Karin Oberlechner. Solving the k-Node Minimum Label Spanning Arborescence Problem with Exact and Heuristic Methods. August 2010, Master’s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms. (Note: supervised by G.~Raidl and A.~Chwatal)