P. Avella and A. Sassano, On the p-Median polytope, Mathematical Programming, vol.89, issue.3, pp.395-411, 2001.
DOI : 10.1007/PL00011405

P. Avella, A. Sassano, and I. Vasil-'ev, Computational study of large-scale p-Median problems, Mathematical Programming, vol.21, issue.1, 2003.
DOI : 10.1007/s10107-005-0700-6

Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications On approximating arbitrary metrices by tree metrics, 37th Annual Symposium on Foundations of Computer Science STOC '98, pp.184-193, 1996.

M. Charikar, C. Chekuri, A. Goel, and S. Guha, Rounding via trees, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.114-123, 1999.
DOI : 10.1145/276698.276719

M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and kmedian problems, 40th Annual Symposium on Foundations of Computer Science, pp.378-388, 1999.

M. Charikar, S. Guha, ´. E. Tardos, and D. B. Shmoys, A Constant-Factor Approximation Algorithm for the k-Median Problem, Journal of Computer and System Sciences, vol.65, issue.1, pp.129-149, 1999.
DOI : 10.1006/jcss.2002.1882

G. Cornuejols, M. L. Fisher, and G. L. Nemhauser, Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms, Management Sci, vol.2377, pp.789-810, 1976.

G. Cornuejols and J. Thizy, Some facets of the simple plant location polytope, Mathematical Programming, vol.15, issue.1, pp.50-74, 1982.
DOI : 10.1007/BF01583779

S. De-vries, M. Posner, and R. Vohra, Polyhedral Properties of the K-median Problem on a Tree, Mathematical Programming, vol.10, issue.2, 2003.
DOI : 10.1007/s10107-006-0002-7

M. Goemans, Notes on the k-median polytope on trees, 1992.

D. S. Hochbaum, Heuristics for the fixed cost median problem, Mathematical Programming, vol.13, issue.8, pp.148-162, 1982.
DOI : 10.1007/BF01581035

W. L. Hsu, The distance-domination numbers of trees, Operations Research Letters, vol.1, issue.3, pp.96-100, 1981.
DOI : 10.1016/0167-6377(82)90005-0

K. Jain and V. V. Vazirani, Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation, Journal of the ACM, vol.48, issue.2, pp.48-274, 2001.
DOI : 10.1145/375827.375845

O. Kariv and S. L. Hakimi, -Medians, SIAM Journal on Applied Mathematics, vol.37, issue.3, pp.539-560, 1979.
DOI : 10.1137/0137041

J. Maurras, Convex hull of the edges of a graph and near bipartite graphs, Discrete Mathematics, vol.46, issue.3, pp.257-265, 1983.
DOI : 10.1016/0012-365X(83)90120-6

S. Nestorov, S. Abiteboul, and R. Motwani, Extracting schema from semistructured data, SIGMOD '98: Proceedings of the 1998 ACM SIGMOD international conference on Management of data, pp.295-306, 1998.
DOI : 10.1145/276305.276331
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.302

A. Schrijver, Combinatorial optimization, Matroids, trees, stable sets, pp.39-69, 2003.

A. Tamir, An O(pn2) algorithm for the p-median and related problems on tree graphs, Operations Research Letters, vol.19, issue.2, pp.59-64, 1996.
DOI : 10.1016/0167-6377(96)00021-1

A. Vigneron, L. Gao, M. J. Golin, G. F. Italiano, and B. Li, An algorithm for finding a -median in a directed tree, Information Processing Letters, vol.74, issue.1-2, pp.81-88, 2000.
DOI : 10.1016/S0020-0190(00)00026-0

R. Ward, P. Lemke, and O. A. , Properties of the k-median linear programming relaxation, technical report, 1988.

I. T. Watson, Y. Center, and . Heights, Econométrie de l'Ecole Polytechnique , 1 rue Descartes , 75005 Paris, France E-mail address