4 citations · 6 across the 10 of their papers we have counts for
11 papers
Envelope Cubic Regularized Newton Method for Nonconvex-Strongly-Concave Minimax Optimization
Qihao Zhou, Lesi Chen, Luo Luo +1
We study nonconvex-strongly-concave minimax problem in which the objective has $ρ…
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 \…
Partial Optimality in Cubic Correlation Clustering for General Graphs
David Stein, Bjoern Andres, Silvia Di Gregorio
The higher-order correlation clustering problem for a graph and costs associated with cliques of consists in finding a clustering of so as to minimize the sum of the co…
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…
Correlation Clustering of Organoid Images
Jannik Presberger, Rashmiparvathi Keshara, David Stein +3
In biological and medical research, scientists now routinely acquire microscopy images of hundreds of morphologically heterogeneous organoids and are then faced with the task of fi…
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.…
Structured Prediction Problem Archive
Paul Swoboda, Bjoern Andres, Andrea Hornakova +6
Structured prediction problems are one of the fundamental tools in machine learning. In order to facilitate algorithm development for their numerical solution, we collect in one pl…