**7. Implementing accelerated updates for the C(Z) algorithm**

We build on the relationships identified in Section 4 to apply them to the more general C(Z) algorithm. By the implications described earlier, our general updates also apply directly to the C(W) and C(Y) algorithms by respectively replacing Z with W and Y (hence Znext with Wnext and Ynext) and replacing MinCostC(∙) by MinCost(∙) and MinCostB(∙).
