▁is ▁a ▁ 3 0 x 6 0 ▁matrix . ▁The ▁two ▁possible ▁tri ang ulations ▁in ▁this ▁example ▁are : ▁ ▁The ▁cost ▁of ▁a ▁single ▁triangle ▁in ▁terms ▁of ▁the ▁number ▁of ▁multip lications ▁needed ▁is ▁the ▁product ▁of ▁its ▁vertices . ▁The ▁total ▁cost ▁of ▁a ▁particular ▁tri ang ulation ▁of ▁the ▁polygon ▁is ▁the ▁sum ▁of ▁the ▁costs ▁of ▁all ▁its ▁tri angles : ▁ ▁( AB ) C : ▁( 1 0 × 3 0 × 5 ) ▁+ ▁( 1 0 × 5 × 6 0 ) ▁= ▁ 1 5 0 0 ▁+ ▁ 3 0 0 0 ▁= ▁ 4 5 0 0 ▁multip lications ▁A ( BC ): ▁( 3 0 × 5 × 6 0 ) ▁+ ▁( 1 0 × 3 0 × 6 0 ) ▁= ▁ 9 0 0 0 ▁+ ▁ 1 8 0 0 0 ▁= ▁ 2 7 0 0 0 ▁multip lications ▁ ▁Hu ▁& ▁Sh ing ▁developed ▁an ▁algorithm ▁that ▁finds ▁an ▁optim um ▁solution ▁for ▁the ▁minimum ▁cost ▁partition ▁problem ▁in ▁O ( n   log   n ) ▁time . ▁ ▁Ch ing - H u - Sh ing ▁Appro xim ating ▁Algorithm ▁ ▁In ▁the ▁introduction ▁of ▁ ▁an ▁approxim ating ▁algorithm , ▁the ▁Ch in - H u - Sh ing ▁approxim ating ▁algorithm , ▁is ▁presented . ▁While ▁this ▁algorithm ▁produces ▁an ▁approximation ▁of ▁the ▁optimal ▁tri ang ulation ▁it ▁is ▁worth ▁explaining ▁it ▁since ▁it ▁makes ▁the ▁understanding ▁of