AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of subsets of a given finite set E and show that this algorithm works exactly for “valuated Δ-matroids.” Examples come from valuation theory
AbstractRecently Dress and Wenzel introduced the concept of a valuated matroid in terms of a quantit...
AbstractGiven a set function, that is, a map ƒ: P(E) → R ≔ R ∪ {−∞} from the set P(E) of subsets of ...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractWe study a disturbed variant of the classical greedy algorithm for weight functions defined ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractΔ-matroids are set systemsM=(E, F) for a finite setEand ∅≠F⊆P(E) which may be characterized ...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractFor the problem maxlcub;Z(S): S is an independent set in the matroid Xrcub;, it is well-know...
AbstractΔ-matroids are set systems which arise, e.g., in the study of greedy algorithms. Similarly t...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractLet S be a finite set and M= (S, B) be a matroid where B is the set of its bases. We say tha...
AbstractRecently Dress and Wenzel introduced the concept of a valuated matroid in terms of a quantit...
AbstractGiven a set function, that is, a map ƒ: P(E) → R ≔ R ∪ {−∞} from the set P(E) of subsets of ...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractWe study a disturbed variant of the classical greedy algorithm for weight functions defined ...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractΔ-matroids are set systemsM=(E, F) for a finite setEand ∅≠F⊆P(E) which may be characterized ...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractFor the problem maxlcub;Z(S): S is an independent set in the matroid Xrcub;, it is well-know...
AbstractΔ-matroids are set systems which arise, e.g., in the study of greedy algorithms. Similarly t...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractLet S be a finite set and M= (S, B) be a matroid where B is the set of its bases. We say tha...
AbstractRecently Dress and Wenzel introduced the concept of a valuated matroid in terms of a quantit...
AbstractGiven a set function, that is, a map ƒ: P(E) → R ≔ R ∪ {−∞} from the set P(E) of subsets of ...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
DOI
Add to ORKG