Tell me more ×
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.
up vote 0 down vote favorite

Given 4 nodes with edge values as stated below, is it possible to build a minimum spanning tree using Steiner tree?

    [0] [1] [2] [3]
[0]             
[1] 110         
[2] 118 121     
[3] 140 238 152
share|improve this question
Your question is very vague. Please clarify what exactly do you want to accomplish. – Jernej Jan 4 at 10:08
1  
Could you please elaborate on why you want to use a Steiner tree? (E.g. include a reference to a text with this or a similar problem.) Although my trigonometry is a bit rusty, I think these distances cannot be realised in a 2D plane, which suggests this is not a Steiner tree problem. – Douglas S. Stones Jan 4 at 10:43

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

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

Browse other questions tagged or ask your own question.