1. Anderson, K., Jörnsten, A.K., Lind, M.: On bicriterion minimal spanning trees: An approximation. Comput. Oper. Res. 23, 1171–1182 (1996)
2. Arroyo, J.E.C., Vieira, P.S., Vianna, D.S.: A GRASP algorithm for the multi-criteria minimum spanning tree problem. In: Second Brazilian Symp. on Graphs (GRACO 2005), Rio de Janeiro, Brazil (2005);
3. Also the Sec. Multidiscip. Conf. on Sched.: Theory and Apps., New York (2005)
4. Balakrishnan, A., Magnanti, T.L., Mirchandani, P.: Heuristics, LPs and trees on trees: Network design analyses. Ops. Res. 44, 478–496 (1996)
5. Bookstein, A., Klein, S.T.: Compression of correlated bit-vectors. Inf. Syst. 16, 110–118 (1996)