Greedy + Dichotomy Time complexity: O(nlogn) To be honest, it is generally good to think of a dynamic programming solution, and it is very difficult to further optimize the time complexity. If you haven't done
Many dynamic multicast routing algorithms have been proposed. The greedy algorithm creates a near optimal tree when a node is added but requires many query/reply messages. The PSPT algorithm cannot construct a cost optimal tree. The VTDM algorithm requires the estimated number of nodes that will...