Part A: 298 random triangle instances, enumeration = integer program: OK
Part B: 236 instances (connected graphs with 3 to 5 vertices), labellings = connectivity: OK
Part C: 2476 instances with unit weights and 2476 with random weights (connected graphs H with 3 to 6 vertices, all choices of three terminals): opt BSP(Gamma) = 2 w(D) + mwc(H): OK
        instances by number of vertices of H (both weightings): {3: 4, 4: 48, 5: 420, 6: 4480}
Part D: 222 instances (H with at most 5 edges): the same optimum by enumeration of all subsets of the light edges: OK
Part E: 222 instances (H with at most 5 edges): unit cost version, same optimum, terminals at distance 8: OK
Part F: 222 instances (H with at most 5 edges): the unit cost construction of the note, terminals at distance 6, opt = 2 |D| + mwc(H): OK
Part G: 822 instances (disconnected graphs H with 3 to 5 vertices and at least one edge, all ordered choices of three terminals; isolated vertices and isolated terminals occur): opt BSP(Gamma) = 2 |D| + mwc(H): OK; 127 of them also for Gamma': OK
time 104 s
