Optimal Augmentation of a Submodular and Posi-modular Set Function by A

@inproceedings{Nagamochi1999OptimalAO,
  title={Optimal Augmentation of a Submodular and Posi-modular Set Function by A},
  author={Hiroshi Nagamochi and Takashi Shiraki},
  year={1999}
}
Given a nite set V and a set function f : 2 V 7! Z, we consider the problem of constructing an undirected multigraph G = (V;E) such that the cut function c G : 2 V 7! Z of G and f together has value at least 2 for all non-empty and proper subsets of V . If f is intersecting submodular and posi-modular, and satis es the tripartite inequality, then we show that such a multigraph G with the minimum number of edges can be found in O((T f + 1)n 4 logn) time, where n = jV j and T f is the time to… CONTINUE READING