Algorithms for the preordering problem and their application to the task of jointly clustering and ordering the accounts of a social network

Jannik Irmai, Maximilian Moeller, Bjoern Andres

The NP-hard maximum value preordering problem is both a joint relaxation and a hybrid of the clique partition problem (a clustering problem) and the partial ordering problem. Towar…