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.

Multicut

This project is open access and publicly accessible.

 

Collections in this community

  • Problem Instances [1]Open Access Icon

    Instances of the minimum cost multicut problem from a variety of applications.

Anonymous users may not see all communities or collections. Please log in to see your accessible communities and colletions.

Recent Submissions

  • Benchmark instances for the min cost multicut problemOpen Access Icon 

    Irmai, Jannik (Technische Universität Dresden, 2023)
    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 ...