Instances of the minimum cost multicut problem from a variety of applications. https://opara.zih.tu-dresden.de/xmlui/handle/123456789/5963 2026-04-05T05:12:18Z 2026-04-05T05:12:18Z Irmai, Jannik https://opara.zih.tu-dresden.de/xmlui/handle/123456789/6008 2023-11-15T07:44:57Z 2023-01-01T00:00:00Z

Benchmark instances for the min cost multicut problem Irmai, Jannik This dataset contains problem instances of the min cost multicut problem (Chopra and Rao (1993)) which is also known as correlation clustering (Demaine et al. (2006)). The instances come from a variety of applications (image segmentation, modularity clustering, birdsong recognition). The origin of the instances is described in more detail in the readme.md file. Some of the instances are derived from graphical models of the opengm benchmark dataset (Kappes et al. (2015)). This benchmark dataset contain a wide variety of graph types (planar graph, sparse non-planar graphs, complete graphs).

2023-01-01T00:00:00Z