• Corpus ID: 244799180

On the Dominant of the Multicut Polytope

  title={On the Dominant of the Multicut Polytope},
  author={Markus Chimani and Martina Juhnke-Kubitzke and Alexander Nover},
Given a graph G = (V,E) and a set S ⊆ ( V 2 ) of terminal pairs, the minimum multicut problem asks for a minimum edge set δ ⊆ E such that there is no s-t-path in G− δ for any {s, t} ∈ S. For |S| = 1 this is the well known s-tcut problem, but in general the minimum multicut problem is NP-complete, even if the input graph is a tree. The multicut polytope MultC (G,S) is the convex hull of all multicuts in G; the multicut dominant is given by MultC(G,S) = MultC (G,S) + RE. The latter is the… 

Figures from this paper


Clique-Web Facets for Multicut Polytopes
This work introduces a large class of inequalities, called clique-web inequalities, valid for these polytopes, and provides a quite complete characterization of thoseClique- web inequalities that define facets of MCk≤n and MCk¬¬n, which can be solved in polynomial time.
On the cut polytope
It is shown that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented.
The Complexity of Multiterminal Cuts
It is shown that the problem becomes NP-hard as soon as $k=3$, but can be solved in polynomial time for planar graphs for any fixed $k$, if the planar problem is NP- hard, however, if £k$ is not fixed.
Max-cut in circulant graphs
On the Lifted Multicut Polytope for Trees
F facets of the lifted multicut polytope for trees defined by the inequalities of a canonical relaxation are characterized, establishing a connection to the combinatorial properties of alternative formulations such as sequential set partitioning.
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
This work presents a complete characterization of P-T-cut with respect to vertices, facets, and adjacency of the s-t-cut polytope.
Primal-dual approximation algorithms for integral flow and multicut in trees
It is shown that both the maximum integral multicommodity flow and the minimum multicut problem are NP-hard and MAX SNP-hard on trees, although themaximum integral flow can be computed in polynomial time if the edges have unit capacity.
Approximating the k-multicut problem
It is shown that the<i>k</i>-multicut problem on trees can be approximated within a factor of 8/3 + ε, for any fixed ε > 0, and within <i>O</i>(log<sup>2</sup> <i*n</i] log log <i+i>) on general graphs, where n is the number of vertices in the graph.
Analysis and Optimization of Graph Decompositions by Lifted Multicuts
To find optimal decompositions defined by minimum cost lifted multicuts, this work establishes some properties of some facets of lifted multicut polytopes, define efficient separation procedures and apply these in a branch-and-cut algorithm.
Facets for the cut cone I
The new class of cycle inequalities is described and the facet property for several subclasses is proved and the “lifting” procedure for constructing facets ofCn+1 from given facets of the lower dimensional coneCn is presented.