A new contribution to the cluster problem

A heuristic algorithm for solving the cluster problem is presented in this paper. The algorithm exploits both the contour tableau and the newly developed path concept, and does not require the choice of a starting node. Experimental results show that the method is competitive with other published algorithms as far as border size is concerned. Furthermore, resultant fill-in is kept small.