1 citations · 1 across the 3 of their papers we have counts for
4 papers
A Polyhedral Study of Lifted Multicuts
Bjoern Andres, Silvia Di Gregorio, Jannik Irmai +1
Fundamental to many applications in data analysis are the decompositions of a graph, i.e. partitions of the node set into component-inducing subsets. One way of encoding decomposit…
Flow-Partitionable Signed Graphs
Jan-Hendrik Lange
The NP-hard problem of correlation clustering is to partition a signed graph such that the number of conflicts between the partition and the signature of the graph is minimized. Th…
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…
Decomposition of Trees and Paths via Correlation
Jan-Hendrik Lange, Bjoern Andres
We study the problem of decomposing (clustering) a tree with respect to costs attributed to pairs of nodes, so as to minimize the sum of costs for those pairs of nodes that are in…