排序方式: 共有1条查询结果,搜索用时 0 毫秒
1
1.
Hiroshi Nagamochi Takashi Shiraki Toshihide Ibaraki 《Journal of Combinatorial Optimization》2001,5(2):175-212
Given a finite set V and a set function
, we consider the problem of constructing an undirected multigraph G = (V,E) such that the cut function
together has value at least 2 for all non-empty and proper subsets of V. If f is intersecting submodular and posi-modular, and satisfies the tripartite inequality, then we show that such a multigraph G with the minimum number of edges can be found in
time, where
is the time to compute the value of f(X) for a subset
. 相似文献
1