7 citations · 8 across the 10 of their papers we have counts for
10 papers
The canonical facets of multi-separator polytopes
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai +2
We initiate a polyhedral study of the graph multi-separator problem proposed by Irmai et al. (2024) as an alternative to the lifted multicut problem for application to the task of…
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…
A 4-approximation algorithm for min max correlation clustering
Holger Heidrich, Jannik Irmai, Bjoern Andres
We introduce a lower bounding technique for the min max correlation clustering problem and, based on this technique, a combinatorial 4-approximation algorithm for complete graphs.…
A Graph Multi-separator Problem for Image Segmentation
Jannik Irmai, Shengxian Zhao, Jannik Presberger +1
We propose a novel abstraction of the image segmentation task in the form of a combinatorial optimization problem that we call the multi-separator problem. Feasible solutions indic…
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…
The Stochastic Bilevel Continuous Knapsack Problem with Uncertain Follower's Objective
Christoph Buchheim, Dorothee Henke, Jannik Irmai
We consider a bilevel continuous knapsack problem where the leader controls the capacity of the knapsack, while the follower chooses a feasible packing maximizing his own profit. T…