Add to ORKGThis paper deals with polymatroids, generalized and bisubmodular polytopes that are expressed by a system of linear inequalities with #left brace#0, #+-#1#right brace#-coefficients. On these polytopes an optimal solution with respect to a linear or convex objective can be determined by a greedy technique. Special bisubmodular functions will be introduced and investigated. These bisubmodular functions are generated by different submodular and supermodular functions. (orig.)SIGLEAvailable from TIB Hannover: RR 4487(1999,12) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
In this paper we investigate k-submodular functions. This natural family of discrete functions inclu...
We present a general model for set systems to be independence families with respect to set families ...
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functio...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
The present note reveals the role of the concept of greedy system of linear inequalities played in c...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
We study the problem of maximizing constrained non-monotone submodular functions and provide approxi...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
We study the problem of maximizing a monotone non-decreasing function {Mathematical expression} subj...
AbstractConvex geometries are closure spaces which satisfy anti-exchange property, and they are know...
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dua...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
We present the Dichotomic Greedy Algorithm (DGA) for the following resource allocation problem: maxi...
Submodular functions play a key role in combinatorial opti-mization and in the study of valued const...
In this paper we investigate k-submodular functions. This natural family of discrete functions inclu...
We present a general model for set systems to be independence families with respect to set families ...
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functio...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
The present note reveals the role of the concept of greedy system of linear inequalities played in c...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
We study the problem of maximizing constrained non-monotone submodular functions and provide approxi...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
We study the problem of maximizing a monotone non-decreasing function {Mathematical expression} subj...
AbstractConvex geometries are closure spaces which satisfy anti-exchange property, and they are know...
Convex geometries are closure spaces which satisfy anti-exchange property, and they are known as dua...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
We present the Dichotomic Greedy Algorithm (DGA) for the following resource allocation problem: maxi...
Submodular functions play a key role in combinatorial opti-mization and in the study of valued const...
In this paper we investigate k-submodular functions. This natural family of discrete functions inclu...
We present a general model for set systems to be independence families with respect to set families ...
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functio...