Add to ORKGThis paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functions, extending the scaling algorithm for submodular function minimization due to Iwata, Fleischer, and Fujishige. Since the rank functions of delta-matroids are bisubmodular, the scaling algorithm naturally leads to the first combinatorial polynomial algorithm for testing membership in delta-matroid polyhedra
Abstract. Submodular function minimization is a key problem in a wide variety of applications in mac...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
Motivated by resource allocation problems (RAPs) in power management applications, we investigate so...
Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
textabstractHuber et al. (SIAM J Comput 43:1064–1084, 2014) introduced a concept of skew bisubmodula...
In this paper we investigate k-submodular functions. This natural family of discrete functions inclu...
This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set function...
Submodular functions are common in combinatorics; examples include the cut capacity function of a gr...
We present a new class of polynomial-time algorithms for submodular function minimization (SFM) as w...
The present paper shows an extension of the theory of principal partitions for submodular functions ...
AbstractWe give a strongly polynomial-time algorithm minimizing a submodular function f given by a v...
We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as ...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
Abstract. Submodular function minimization is a key problem in a wide variety of applications in mac...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
Motivated by resource allocation problems (RAPs) in power management applications, we investigate so...
Bisubmodular functions are a natural “directed”, or “signed”, extension of submodular functions with...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
This paper presents the first combinatorial polynomial-time algorithm for minimizing submodular func...
textabstractHuber et al. (SIAM J Comput 43:1064–1084, 2014) introduced a concept of skew bisubmodula...
In this paper we investigate k-submodular functions. This natural family of discrete functions inclu...
This paper presents a combinatorial polynomial-time algorithm for minimizing submolular set function...
Submodular functions are common in combinatorics; examples include the cut capacity function of a gr...
We present a new class of polynomial-time algorithms for submodular function minimization (SFM) as w...
The present paper shows an extension of the theory of principal partitions for submodular functions ...
AbstractWe give a strongly polynomial-time algorithm minimizing a submodular function f given by a v...
We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as ...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
Abstract. Submodular function minimization is a key problem in a wide variety of applications in mac...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
Motivated by resource allocation problems (RAPs) in power management applications, we investigate so...