5 papers
Graph Neural Networks with Triangle-Based Messages for the Multicut Problem
Jannik Irmai, Lucas Fabian Naumann, Bjoern Andres
The multicut problem is an NP-hard combinatorial optimization problem with diverse applications in fields such as bioinformatics, data mining and computer vision. Graph neural netw…
Partial Optimality in the Preordering Problem
David Stein, Jannik Irmai, Bjoern Andres
Preordering is a generalization of clustering and partial ordering with applications in bioinformatics and social network analysis. Given a finite set and a value $c_{ab} \in \…
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…
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…
Box Facets and Cut Facets of Lifted Multicut Polytopes
Lucas Fabian Naumann, Jannik Irmai, Shengxian Zhao +1
The lifted multicut problem is a combinatorial optimization problem whose feasible solutions relate one-to-one to the decompositions of a graph . Given an augmentation…