AbstractCharacteristic structural properties are established for those greedoids where the greedy algorithm selects a maximal word for each linear objective function defined on it
AbstractThe two variable greedoid Tutte polynomialf(G;t,z), which was introduced in previous work of...
AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper e...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractVarious types of greedoids have been studied in relation to the Greedy Algorithm and therefo...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractS is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
AbstractUndirected branching greedoids are defined by rooted trees of a graph. We give a minor crite...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractLet (V, D) be an directed graph and P0ϵV. Define F := {X ⊆ D: X is a branching rooted at P0}...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
AbstractThe two variable greedoid Tutte polynomialf(G;t,z), which was introduced in previous work of...
AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper e...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractVarious types of greedoids have been studied in relation to the Greedy Algorithm and therefo...
AbstractIt is well known that the problem of finding a maximum-weight base of matroid can be solved ...
AbstractThe Greedy Algorithm selects heaviest sets from a collection of subsets. Traditionally, it i...
AbstractS is a local maximum stable set of a graph G, and we write S∈Ψ(G), if the set S is a maximum...
AbstractPerhaps the best known algorithm in combinatorial optimization is the greedy algorithm. A na...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractWe establish a necessary and sufficient condition for a greedy algorithm to find an optimal ...
AbstractUndirected branching greedoids are defined by rooted trees of a graph. We give a minor crite...
AbstractWe call a set system of feasible sets hereditary if every (k+1)-element feasible set contain...
AbstractLet (V, D) be an directed graph and P0ϵV. Define F := {X ⊆ D: X is a branching rooted at P0}...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
AbstractThe two variable greedoid Tutte polynomialf(G;t,z), which was introduced in previous work of...
AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper e...
Greedy algorithms are used in solving a diverse set of problems in small computation time. However, ...
DOI
Add to ORKG