Abstract
The bicluster editing problem (BEP) consists of editing (adding or removing) the edges of a bipartite graph G in order to transform it into a vertex-disjoint union of complete bipartite subgraphs, in such a way that the sum of the weights of the edited edges is minimum. In this paper, we propose five parallel strategies for the implementation of a hybrid metaheuristic for the BEP, consisting of a GRASP with VNS as local search. Computational experiments show near-linear speedups on Linux cluster with 64 processors and better solutions than those of the sequential approach.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have