| Other contributing persons, institutions or organisations | Stein, David - TU Dresden - WorkPackageLeader | |
| Other contributing persons, institutions or organisations | smwk - Funder | |
| Person(s) who is (are) responsible for the content of the research data | Irmai, Jannik | |
| Abstract | 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). | |
| Language | eng | |
| Year or period of data production | 2015-2023 | |
| Publication year | 2023 | |
| Publisher | Technische Universität Dresden | |
| References on related materials | IsPartOf: 123456789/5963 (Handle) | |
| Content of the research data | Dataset: Graph structures and edge costs for the min cost multicut problem | |
| Holder of usage rights | Technische Universität Dresden | |
| Usage rights of the data | CC-BY-4.0 | |
| Discipline(s) | Computer Science | de |
| Title of the dataset | Benchmark instances for the min cost multicut problem | |
