Sentence examples for minimizing a submodular from inspiring English sources

We show that the separation problem for the so-called partition inequalities reduces to minimizing a submodular function.

For specific combinatorial optimization problems such a min-cost flow, matching, matroid intersection and the problem of minimizing a submodular function, we discuss the basics of the related combinatorial algorithms.

The payoff comes from averting or minimizing a disaster.

However, minimizing submodular functions poses a number of algorithmic challenges.

Recent work introduced an easy-to-use, parallelizable algorithm for minimizing submodular functions that decompose as the sum of "simple" submodular functions.

Such exercises help minimize a patient's movements.

As for the request routing subproblem, we solve it by transforming it into the problem of maximizing a submodular function subject to a matroid constraint and present a greedy algorithm that schedules request routing with short time slot.

One exception occurs in the case of maximizing a submodular function, where it was shown in [31] that unless (mathcal {P}=mathcal {NP}), a greedy algorithm will yield the optimal approximation.

In this paper, we present a novel algorithm for minimizing this objective function (submodular fractional programming) using recent submodular optimization techniques.

We investigate three related and important problems connected to machine learning: approximating a submodular function everywhere, learning a submodular function (in PAC-like setting), and constrained minimization of submodular functions.

The objective function for balanced clustering is a submodular fractional function, i.e., the ratio of two submodular functions, and thus includes the well-known ratio cuts as special cases.