Laber, E., & Molinaro, M. (2009). Improved Approximations for the k-Hotlink Assignment Problem and for Binary Searching in Trees. In Anais do XXII Concurso de Teses e Dissertações, (pp. 89-96). Porto Alegre: SBC.