Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have this problem : given undirected graph we can build a tree that approximates the distances from given vertex ,r, and the total weight,
i.e. for every vertex x, $d_G(r,x) \le d_T(r,x) \le 3d_G(r,x)$ and : $w(T) \le 3MST(G)$ could any one help me to understand how to build this tree and if there are any material that would help ...

share|cite|improve this question
up vote 1 down vote accepted

You are looking for a Tree Spanner. In general it is NP-Hard to find such a tree for weighted and unweighted graphs, but it can be found in polynomial time in few special cases. You can find more information about it and more related results in this paper:

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.