DOIAbstract
AbstractCharacteristic structural properties are established for those greedoids where the greedy algorithm selects a maximal word for each linear objective function defined on it
AbstractCharacteristic structural properties are established for those greedoids where the greedy algorithm selects a maximal word for each linear objective function defined on it
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
AbstractS is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum...
Abstract. Moderated greedy search is based on the idea that it is hel-pful for greedy search algorit...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractIn a natural way, a new class of set system is defined in terms of transversals of a family ...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
AbstractS is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum...
Abstract. Moderated greedy search is based on the idea that it is hel-pful for greedy search algorit...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractIn this paper we present a new optimization problem and a general class of objective functio...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
It is well known that the greedy algorithm solves matroid base problems for all linear cost function...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractIn a natural way, a new class of set system is defined in terms of transversals of a family ...
A greedy algorithm solves a dual pair of linear programs where the primal variables are associated t...
AbstractThis paper presents principles for the classification of greedy algorithms for optimization ...
AbstractS is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum...
Abstract. Moderated greedy search is based on the idea that it is hel-pful for greedy search algorit...
Add to ORKG