Add to ORKGAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kiel C 141811 / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
This letter studies the problem of minimizing increasing set functions, equivalently, maximizing dec...
SIGLETIB: RN 4052 (86423-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractWe define a hereditary system on a finite set U as a partition of the family 2U of all subse...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
We present a general model for set systems to be independence families with respect to set families ...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractFor the problem maxlcub;Z(S): S is an independent set in the matroid Xrcub;, it is well-know...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractΔ-matroids are set systemsM=(E, F) for a finite setEand ∅≠F⊆P(E) which may be characterized ...
AbstractLet S be a finite set and M= (S, B) be a matroid where B is the set of its bases. We say tha...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
This letter studies the problem of minimizing increasing set functions, equivalently, maximizing dec...
SIGLETIB: RN 4052 (86423-OR) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Informati...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractWe define a hereditary system on a finite set U as a partition of the family 2U of all subse...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
We present a general model for set systems to be independence families with respect to set families ...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractFor the problem maxlcub;Z(S): S is an independent set in the matroid Xrcub;, it is well-know...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractΔ-matroids are set systemsM=(E, F) for a finite setEand ∅≠F⊆P(E) which may be characterized ...
AbstractLet S be a finite set and M= (S, B) be a matroid where B is the set of its bases. We say tha...
Generalizing the idea of the Lovász extension of a set function and the discrete Choquet integral, w...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
This letter studies the problem of minimizing increasing set functions, equivalently, maximizing dec...