72 citations · 113 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CV2018
End-to-end Learning for Graph Decomposition
Jie Song, Bjoern Andres, Michael Black +2
We propose a novel end-to-end trainable framework for the graph decomposition problem. The minimum cost multicut problem is first converted to an unconstrained binary cubic formula…
math.OC2018
Combinatorial persistency criteria for multicut and max-cut
Jan-Hendrik Lange, Bjoern Andres, Paul Swoboda
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max…