D. S. Hochbaum and D. B. Shmoys, A unified approach to approximation algorithms for bottleneck problems, Journal of the ACM, vol.33, issue.3, pp.533-550, 1986.
DOI : 10.1145/5925.5933

R. Karp, Reducibility among combinatorial problems, Complexity of Computer Computations, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

C. Laforest, B. [. Rouits, J. C. Moulierac, and J. Palaysi, Leprobì eme du k-fournisseur: technique d'approximation et aspect incrémental INRIA algotel, 2000.

G. Robins and A. Zelikovsky, Improved Steiner tree approximation in graphs, Proc. of SODA, 2000.