1. Abdalla A., Deo N., and Gupta P. 2000. Random-tree diameter and the diameter constrained MST. In Congressus Numerantium, Vol. 144. 161--182.
2. Bookstein A. and Klein S. T. 1996. Compression of correlated bit-vectors. Inf Syst 16 (1996), 110--118.
3. Julstrom B. A. 2004. Encoding bounded-diameter spanning trees with permutations and with random keys. In Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, Vol. 3102. 1272--1281.
4. Julstrom B. A. 2009. Greedy heuristics for the bounded diameter minimum spanning tree problem. ACM Journal of Experimental Algorithmics 14 (2009).
5. Singh A. and Gupta A. K. 2007. Improved heuristics for the bounded-diameter minimum spanning tree problem. Soft Comput. 11, 10 (2007), 911--921.