cut polyhedron

For a subset T of nodes of an undirected graph G, a T-Steiner cut is a cut δ(S) where S intersects both T and the complement of T. The T-Steiner cut dominant} of G is the dominant CUT_+(G,T) of the convex hull of the incidence vectors of the T-Steiner cuts of G. For T={s,t}, this … Read more