Combinatorial optimization problems (COPs) encompass a class of problems that are aimed at finding optimal or near-optimal solutions within a finite solution space and that are prevalent in both ...
We develop an algorithm that finds the consensus among many different clustering solutions of a graph. We formulate the problem as a median set partitioning problem and propose a greedy optimization ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results