To reduce the amount of lower bounds actually calculated, the winner-update search strategy is used for tree traversal.

• 为了减少所真正计算之距离下限个数，我们利用赢者更新搜寻策略来计算下限树中节点的下限。