Benchmark instances for the min cost multicut problem

The OPARA service was recently upgraded to a new technical platform. You are visiting the outdated OPARA website. Please use https://opara.zih.tu-dresden.de/ for new data submissions. Previously stored data will be migrated in near future and then the old version of OPARA will finally be shut down. Existing DOIs for data publications remain valid.

Zur Kurzanzeige

Metadaten

Weitere mitwirkende Personen, Institutionen oder Unternehmen	Stein, David - TU Dresden - WorkPackageLeader
Weitere mitwirkende Personen, Institutionen oder Unternehmen	smwk - Funder
Für den Inhalt der Forschungsdaten verantwortliche Person(en)	Irmai, Jannik
Kurzbeschreibung	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).
Sprache	eng
Entstehungsjahr oder Entstehungszeitraum	2015-2023
Veröffentlichungsjahr	2023
Herausgeber	Technische Universität Dresden
Referenzen auf ergänzende Materialien	IsPartOf: 123456789/5963 (Handle)
Inhalt der Forschungsdaten	Dataset: Graph structures and edge costs for the min cost multicut problem
Inhaber der Nutzungsrechte	Technische Universität Dresden
Nutzungsrechte des Datensatzes	CC-BY-4.0
Angabe der Fachgebiete	Computer Science	de
Titel des Datensatzes	Benchmark instances for the min cost multicut problem