OPTIMAL EMBEDDINGS OF FINITE METRIC SPACES INTO GRAPHS

We consider the embedding of a finite metric space into a weighted graph in such a way that the total weight of the edges is minimal. We discuss metric spaces with  points in detail and show that the already known classification for these cases can be obtained by simple operations on the associated graph of the given metric space.