arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.14802math.COmath.OC
收藏

Steiner 割控制集

Steiner Cut Dominants

Michele Conforti, Volker Kaibel

AI总结:

本文研究无向图中的 T-Steiner 割控制集,证明其非平凡面不等式可由有限基不等式经两种运算生成,并给出 |T|≤5 时的完整面描述。

摘要:

对于无向图 G 的节点子集 T,T-Steiner 割是指割 δ(S),其中 S 同时与 T 及 T 的补集相交。G 的 T-Steiner 割控制集是 G 的 T-Steiner 割关联向量凸包的控制集 CUT_+(G,T)。当 T={s,t} 时,这就是已被充分理解的 s-t-割控制集。选择 T 为 G 的所有节点集合,我们得到割控制集,而其在原始变量空间中的外部描述至今仍未知。我们证明,对于每个整数 τ,存在一个有限的不等式集合,使得对于每一对满足 |T|≤τ 的 (G,T),CUT_+(G,T) 的非平凡定义面不等式都可以从该集合出发,通过迭代应用两种简单运算得到。特别地,在用整数不等式描述 CUT_+(G,T) 时,系数和右端项的绝对值可以由 |T| 的一个函数给出上界。对于所有 |T|≤5,我们给出了 CUT_+(G,T) 的定义面不等式描述,推广了已知的 s-t-割控制集描述。

英文摘要:

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 is the well-understood s-t-cut dominant. Choosing T as the set of all nodes of G, we obtain the \emph{cut dominant}, for which an outer description in the space of the original variables is still not known. We prove that, for each integer τ, there is a finite set of inequalities such that for every pair (G,T) with |T|\ <= τthe non-trivial facet-defining inequalities of CUT_+(G,T) are the inequalities that can be obtained via iterated applications of two simple operations, starting from that set. In particular, the absolute values of the coefficients and of the right-hand-sides in a description of CUT_+(G,T) by integral inequalities can be bounded from above by a function of |T|. For all |T| <= 5 we provide descriptions of CUT_+(G,T) by facet defining inequalities, extending the known descriptions of s-t-cut dominants.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑