---
res:
  bibo_abstract:
  - We propose a dual decomposition and linear program relaxation of the NP-hard minimum
    cost multicut problem. Unlike other polyhedral relaxations of the multicut polytope,
    it is amenable to efficient optimization by message passing. Like other polyhedral
    relaxations, it can be tightened efficiently by cutting planes.  We define an
    algorithm that alternates between message passing and efficient separation of
    cycle- and odd-wheel inequalities. This algorithm is more efficient than state-of-the-art
    algorithms based on linear programming, including algorithms written in the framework
    of leading commercial software, as we show in experiments with large instances
    of the problem from applications in computer vision, biomedical image analysis
    and data mining.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Paul
      foaf_name: Swoboda, Paul
      foaf_surname: Swoboda
      foaf_workInfoHomepage: http://www.librecat.org/personId=446560C6-F248-11E8-B48F-1D18A9856A87
  - foaf_Person:
      foaf_givenName: Bjoern
      foaf_name: Andres, Bjoern
      foaf_surname: Andres
  bibo_doi: 10.1109/CVPR.2017.530
  bibo_volume: 2017
  dct_date: 2017^xs_gYear
  dct_identifier:
  - UT:000418371405009
  dct_isPartOf:
  - http://id.crossref.org/issn/978-153860457-1
  dct_language: eng
  dct_publisher: IEEE@
  dct_title: A message passing algorithm for the minimum cost multicut problem@
...