no code implementations • 9 Feb 2023 • David Stein, Silvia Di Gregorio, Bjoern Andres
The higher-order correlation clustering problem is an expressive model, and recently, local search heuristics have been proposed for several applications.
no code implementations • 16 Feb 2022 • Bjoern Andres, Silvia Di Gregorio, Jannik Irmai, Jan-Hendrik Lange
Recently, a lifting of multicuts from a graph $G = (V, E)$ to an augmented graph $\hat G = (V, E \cup F)$ has been proposed in the field of image analysis, with the goal of obtaining a more expressive characterization of graph decompositions in which it is made explicit also for pairs $F \subseteq \tbinom{V}{2} \setminus E$ of non-neighboring nodes whether these are in the same or distinct components.