Add to ORKGThis 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.Comment: 22 pages, 1 figur
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submod...
Submodular maximization under various constraints is a fundamental problem studied continuously, in ...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
AbstractBalanced submodular flows generalize balanced flows as introduced by Minoux (1976) in the di...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
AbstractIn the present paper we extend the out-of-kilter method for the ordinary minimum-cost flow p...
AbstractEdmonds and Giles [1] discuss functions on the arcs of a digraph satisfying submodular set c...
AbstractWe give a strongly polynomial-time algorithm minimizing a submodular function f given by a v...
AbstractThis paper presents a cost-scaling algorithm for minimum cost 0–1 submodular flows. The algo...
We describe an O/(n exp.4 h min{log U, n exp.2 log n}) capacity scaling algorithm for the minimum co...
AbstractA submodular polyhedron is a polyhedron associated with a submodular function. This paper pr...
In this thesis, we consider combinatorial optimization problems involving submodular functions and ...
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued s...
We consider two related problems, the Minimum Bounded Degree Matroid Basis problem and the Minimum B...
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submod...
Submodular maximization under various constraints is a fundamental problem studied continuously, in ...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...
AbstractBalanced submodular flows generalize balanced flows as introduced by Minoux (1976) in the di...
AbstractWe pose a new network flow problem and solve it by reducing to the b-matching problem. The r...
AbstractIn the present paper we extend the out-of-kilter method for the ordinary minimum-cost flow p...
AbstractEdmonds and Giles [1] discuss functions on the arcs of a digraph satisfying submodular set c...
AbstractWe give a strongly polynomial-time algorithm minimizing a submodular function f given by a v...
AbstractThis paper presents a cost-scaling algorithm for minimum cost 0–1 submodular flows. The algo...
We describe an O/(n exp.4 h min{log U, n exp.2 log n}) capacity scaling algorithm for the minimum co...
AbstractA submodular polyhedron is a polyhedron associated with a submodular function. This paper pr...
In this thesis, we consider combinatorial optimization problems involving submodular functions and ...
This paper presents a new simple algorithm for minimizing submodular functions. For integer valued s...
We consider two related problems, the Minimum Bounded Degree Matroid Basis problem and the Minimum B...
AbstractIn an earlier paper we develop a quite general dual method and apply it to balanced submodul...
We describe an O(n 4 h min{log U, n 2 log n}) capacity scaling algorithm for the minimum cost submod...
Submodular maximization under various constraints is a fundamental problem studied continuously, in ...
We show that the Balanced Network Flow Problem in the case of general weights, i.e., the problem of...