Minimizing submodular functions over families of sets |
| |
Authors: | M X Goemans V S Ramakrishnan |
| |
Institution: | (1) Department of Mathematics, MIT, 02139 Cambridge, MA;(2) McKinsey & Co., Boston, MA |
| |
Abstract: | We consider the problem of characterizing the minimum of a submodular function when the minimization is restricted to a family of subsets. We show that, for many interesting cases, there exist two elementsa andb of the groundset such that the problem is equivalent to the problem of minimizing the submodular function over the sets containinga but notb. This leads to a polynomial-time algorithm for minimizing a submodular function over these families of sets. Our results apply, for example, to the families of odd cardinality subsets or even cardinality subsets separating two given vertices, or to the complement of a lattice family of subsets. We also derive that the second smallest value of a submodular function over a lattice family can be computed in polynomial-time. These results generalize and unify several known results.Research partially supported by NSF contract 9302476-CCR, Air Force contract F49620-92-J-0125 and DARPA contract N00014-92-J-1799. |
| |
Keywords: | 90 C 27 05 C 40 90 C 35 |
本文献已被 SpringerLink 等数据库收录! |
|