M. I. Andreica and N. Tapus, Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling, 2008 International Symposium on Parallel and Distributed Computing, pp.285-292, 2008.
DOI : 10.1109/ISPDC.2008.36
URL : https://hal.archives-ouvertes.fr/hal-00912359

M. A. Bender and M. Farach-colton, The LCA Problem Revisited, Lecture Notes in Computer Science, vol.1776, pp.88-94, 2004.
DOI : 10.1007/10719839_9

D. Z. Chen, M. A. Healy, C. Wang, and B. Xu, Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications, Lecture Notes in Computer Science, vol.4613, pp.1-13, 2007.
DOI : 10.1007/978-3-540-73814-5_1

C. W. Duin and A. Volgenant, An addendum to the hierarchical network design problem, European Journal of Operational Research, vol.92, issue.1, pp.214-216, 1996.
DOI : 10.1016/0377-2217(96)00016-1

A. Farago, A. Szentesi, and B. Szviatovszki, Inverse optimization in high-speed networks, Discrete Applied Mathematics, vol.129, issue.1, pp.83-98, 2003.
DOI : 10.1016/S0166-218X(02)00235-4

S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, and S. S. Ravi, Approximation Algorithms for Certain Network Improvement Problems, 1998.