Algorithm BLS has a worst-case guarantee no more than 1+B, the bound indicates that it becomes very poor in extreme caseswhere B is algorithm BLPT provides worst case error bound 3.

• 算法BLS和算法BEDD得到一个性能指标为1+B。 贪婪算法QRLPT给出原问题的一个最差性能比为3。