E. Laber and M. Molinaro. " Improved Approximations for the k-Hotlink Assignment Problem and for Binary Searching in Trees", in Anais do XXII Concurso de Teses e Dissertações, Bento Gonçalves/RS, 2009, pp. 89-96.