Balanced Submodular Flows

08/23/2023
by   Alpár Jüttner, et al.
0

This paper examines the Balanced Submodular Flow Problem, that is the problem of finding a feasible submodular flow minimizing the difference between the flow values along the edges. A min-max formula is given to the problem and an algorithm is presented to solve it using O(m^2) submodular function minimizations. Then, these result are extended to the weighted version of the problem. Finally, the Balanced Integer Submodular Flow Problem is discussed.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

Minimizing approximately submodular functions

The problem of minimizing a submodular function is well studied; several...
research
12/15/2022

Min-max Submodular Ranking for Multiple Agents

In the submodular ranking (SR) problem, the input consists of a set of s...
research
05/26/2023

Submodular Minimax Optimization: Finding Effective Sets

Despite the rich existing literature about minimax optimization in conti...
research
09/28/2013

Structured learning of sum-of-submodular higher order energy functions

Submodular functions can be exactly minimized in polynomial time, and th...
research
06/22/2016

Joint M-Best-Diverse Labelings as a Parametric Submodular Minimization

We consider the problem of jointly inferring the M-best diverse labeling...
research
12/23/2017

Finding Submodularity Hidden in Symmetric Difference

A set function f on a finite set V is submodular if f(X) + f(Y) ≥ f(X ∪...
research
12/23/2017

Finding the Submodularity Hidden in Symmetric Difference

A fundamental property of convex functions in continuous space is that t...

Please sign up or login with your details

Forgot password? Click here to reset