atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

A Message Passing Algorithm for the Minimum Cost Multicut Problem

CVPR 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 22 citations (OpenAlex)

Check your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add odd-wheel inequalities to cycle-only message passing (ablation)MP-C · image-segLB: 4434.69 -> 4434.71No clear effect
Add odd-wheel inequalities to cycle-only message passing (ablation)MP-C · image-segtime(s): 21.92 -> 41.35Hurt
Add odd-wheel inequalities to cycle-only message passing (ablation)MP-C · modularity clusteringLB: -0.53 -> -0.53No clear effect
Add odd-wheel inequalities to cycle-only message passing (ablation)MP-C · CREMI-largeLB: -3892753.21 -> -3893090.30Hurt
Use message-passing multicut optimization instead of MC-ILPimage-seg · image-segtime(s): 11.89 -> 41.35Hurt
Use message-passing multicut optimization instead of MC-ILPmodularity clustering · modularity clusteringtime(s): 2911.10 -> 0.80Helped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy