§2, p. 200 and §4, p. 203 — every table entry $S[D,I]$ of Algorithm A is the Steiner length of $\{I\} \cup D$

Initializing...

§2, p. 200 and §4, p. 203 — every table entry $S[D,I]$ of Algorithm A is the Steiner length of $\{I\} \cup D$ · Prove2Me