We conduct comprehensive comparative experiments of those algorithms.
we test the greedy algorithm, the greedy algorithm with performance guarantee, the stack decoding, the linear relaxation problem with randomized decoding, and the branch-andbound method.