3 papers
cs.LG2025
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…
cs.DM2024
Chorded cycle facets of the clique partitioning polytope
Jannik Irmai, Lucas Fabian Naumann, Bjoern Andres
The -chorded -cycle inequalities are a class of valid inequalities for the clique partitioning polytope. It is known that for , these inequalitie…
cs.DM2022
A Polyhedral Study of Lifted Multicuts
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai +1
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decomposit…