Fig. 9 | Mathematical Programming

Fig. 9

From: Electrical flows over spanning trees

Fig. 9

Top left: An example of a \(5\times 5\) grid, where the root r is the green node in the bottom-left corner, all the demands are 1, and the resistances for each edge are given in the figure. These edge resistances are chosen in an adversarial manner to demonstrate how SPTs are oblivious to node demands. Top right: The SPT with respect to the adversarial edge resistances and its cost. Bottom left: The LM tree for adversarial instance and its cost. Bottom right: The optimal tree for adversarial instance and its cost

Back to article page