Problem 3553 · Hard

Minimum Weighted Subgraph With the Required Paths II

In a tree, the cheapest subgraph joining three nodes has weight half the sum of the three pairwise distances.

Open the interactive visualisation