no code implementations • 26 Feb 2024 • Lucas Fabian Naumann, Jannik Irmai, Shengxian Zhao, Bjoern Andres
For $F = \emptyset$, the problem specializes to the multicut problem, and for $E = \tbinom{V}{2}$ to the clique partitioning problem.
no code implementations • 10 Jul 2023 • Jannik Irmai, Shengxian Zhao, Jannik Presberger, Bjoern Andres
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.