Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    0
    ReputationRep:
    I am studying the D2 edexcel syllabus at the moment and have just done residual minimum spanning trees (RMST) but I don't know why when to work out all of the RMSTs after taking out the nodes you select the one with the highest route length?

    Can anyone help?
    • Study Helper
    Offline

    13
    Study Helper
    (Original post by damacfish)
    I am studying the D2 edexcel syllabus at the moment and have just done residual minimum spanning trees (RMST) but I don't know why when to work out all of the RMSTs after taking out the nodes you select the one with the highest route length?

    Can anyone help?
    "residual minimum spanning tree" seems to be a term unique to Edexcel.

    From looking at the book, any RMST (+ the 2 extra arcs) will have a weight less than or equal to the optimal solution. Hence the hightest value is still less than or equal to the optimal solution.

    The RMSTs are being used to find a lower bound on the optimal solution, so you want it to be as high as possible to reduce the range in which the optimal solution lies.
    • Thread Starter
    Offline

    0
    ReputationRep:
    But surely there could be an optimal solution, and then from taking out another point, the result could be larger than the previous one and then the then solution would be less than the highest value. I guess what I am trying to ask is there a way proving that there could not be a solution higher than the optimal solution given by this method
    • Study Helper
    Offline

    13
    Study Helper
    (Original post by damacfish)
    But surely there could be an optimal solution, and then from taking out another point, the result could be larger than the previous one and then the then solution would be less than the highest value. I guess what I am trying to ask is there a way proving that there could not be a solution higher than the optimal solution given by this method
    Well suppose you do have an optimal solution.

    Remove a node.

    What's left is a spanning tree (or worse, can't recall the details as it's now a week since I replied, and I'm not going hunting for Edexcel's definitions again), but it's not necessarily minimal.

    So a minimal spanning tree will have an equal of lower weight than what you now have. Then by adding in the node again, using the two lowest weighted edges, guarantees that the result will have a lower or equal weight than the optimal solution, since in the optimal solution the two additional edges won't necessarily be the lowest weighted ones associated with that node.

    Since this applies to all nodes removed, in turn, the maximum value of the RMSTs+2 must be less than or equal to the optimal solution.
 
 
 
Poll
Do you agree with the PM's proposal to cut tuition fees for some courses?
Useful resources

Make your revision easier

Maths

Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

Equations

How to use LaTex

Writing equations the easy way

Student revising

Study habits of A* students

Top tips from students who have already aced their exams

Study Planner

Create your own Study Planner

Never miss a deadline again

Polling station sign

Thinking about a maths degree?

Chat with other maths applicants

Can you help? Study help unanswered threads

Groups associated with this forum:

View associated groups

The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

Write a reply...
Reply
Hide
Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.