Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Hi-index | 0.00 |
In this paper we show, by providing a counterexample, that a heuristic used in [3] is wrong. We also propose an alternative solution, which in addition to being correct, also seems to offer better possibilities for parallelization.