1
$\begingroup$

I have a set of edge weighted trees, each tree rooted at some vertex. Consider these trees are hung from the roots and vertices are arranged in some levels. I wish to design an algorithm (theoretically) which arranges the vertices such that, vertices nearer to root should lie in upper levels (levels nearer to root). Here, nearer is in terms of weighted distance, not hop count. I am trying to figure out what technique I should use or what parameter should I focus to perform this task. Please share some ideas that can help build the algorithm or procedure. One more help, someone please add a tag for problems related to "Steiner tree".

Improve this question
$\endgroup$
4
  • 1
    $\begingroup$ it's always good to use a top level tag. I added combinatorics $\endgroup$
    – kodlu
    Aug 8, 2022 at 11:49
  • $\begingroup$ Thanks, I shall use this suggestion. $\endgroup$
    – Hemraj Raikwar
    Aug 8, 2022 at 14:26
  • 1
    $\begingroup$ Re: the last sentence, you can add any tags to your own post that you please, but currently no more tags can be added (maximum of 5). $\endgroup$
    – LSpice
    Aug 8, 2022 at 14:37
  • $\begingroup$ It requires a reputation of 300. $\endgroup$
    – Hemraj Raikwar
    Aug 9, 2022 at 11:51

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.