Greedoids
From MaRDI portal
Publication:810029
zbMATH Open0733.05023MaRDI QIDQ810029FDOQ810029
Authors: Bernhard Korte, Rainer Schrader, László Lovász
Publication date: 1991
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)
Cited In (only showing first 100 items - show all)
- Chordal graphs and their clique graphs
- Network structures with hierarchy and communication
- Unicycle graphs and uniquely restricted maximum matchings
- Antimatroids induced by matchings
- The max-flow min-cut property of two-dimensional affine convex geometries
- Forbidden subgraphs and the König-Egerváry property
- Characterizations of the convex geometries arising from the double shellings of posets
- On maximin share allocations in matroids
- On imposing connectivity constraints in integer programs
- Gross substitutability: an algorithmic survey
- Excluded-minor characterizations of antimatroids arisen from posets and graph searches.
- The forbidden minor characterization of line-search antimatroids of rooted digraphs
- Log-concave poset inequalities (extended abstract)
- The complexity of the matroid-greedoid partition problem
- A greedy algorithm for interval greedoids
- A Tutte polynomial which distinguishes rooted unicyclic graphs
- Anti-matroids
- Closure spaces that are not uniquely generated
- Expected value expansions in rooted graphs
- Minimum partition of an independence system into independent sets
- Well-layered maps and the maximum-degree \(k \times k\)-subdeterminant of a matrix of rational functions
- Well-layered maps---a class of greedily optimizable set functions
- The greedy algorithm and Coxeter matroids
- Enumerating maximal consistent closed sets in closure systems
- Polluted river problems and games with a permission structure
- Closure lattices
- Convex geometries are extremal for the generalized Sauer-Shelah bound
- The \(S\)-digraph optimization problem and the greedy algorithm
- Pfaffian forms and \(\Delta\)-matroids with coefficients
- Title not available (Why is that?)
- Categories of \((I, I)\)-fuzzy greedoids
- Dynamic programming and graph optimization problems
- On the geometric structure of independence systems
- An extended formulation of the convex recoloring problem on a tree
- Expected rank in antimatroids
- On verifying and engineering the wellgradedness of a union-closed family
- Greedoids and Linear Objective Functions
- Multiple facility location on a network with linear reliability order of edges
- Interpolation theorems for graphs, hypergraphs and matroids
- When bad things happen to good trees
- Title not available (Why is that?)
- Finding a maximum-weight convex set in a chordal graph
- A note on selectors and greedoids
- Fragmentary structures in discrete optimization problems
- Title not available (Why is that?)
- A representation of antimatroids by Horn rules and its application to educational systems
- Title not available (Why is that?)
- Injection geometries
- Greedoids from flames
- Title not available (Why is that?)
- Algorithms for media
- A unified interpretation of several combinatorial dualities
- On unicyclic graphs with uniquely restricted maximum matchings
- A system-theoretic model for cooperation, interaction and allocation
- Fuzzy greedoids
- Pruning processes and a new characterization of convex geometries
- The structure of a linear chip firing game and related models
- Compressed representation of learning spaces
- Interaction indices for games on combinatorial structures with forbidden coalitions
- On the topology of the free complexes of convex geometries
- On the rank functions of \(\mathcal{H}\)-matroids
- A branching greedoid for multiply-rooted graphs and digraphs
- Title not available (Why is that?)
- The Bhargava greedoid
- Matroids and antimatroids - a survey
- Generating and characterizing the perfect elimination orderings of a chordal graph
- Polymatroid greedoids
- The Erdos-Szekeres problem on points in convex position – a survey
- Greedy algorithm and symmetric matroids
- Optimizing phylogenetic diversity under constraints
- Duality between quasi-concave functions and monotone linkage functions
- Greedy solutions of selection and ordering problems
- Decompositions in complete lattices. III: Unique irredundant decompositions and convex geometries
- Pseudomatroids
- Convexity properties for interior operator games
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
- Vertex covering with capacitated trees
- Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
- A greedy algorithm for convex geometries
- Title not available (Why is that?)
- Enumeration in convex geometries and associated polytopal subdivisions of spheres
- The Clique Corona Operation and Greedoids
- Cooperative games on antimatroids
- Topologically sweeping visibility complexes via pseudotriangulations
- On local maximum stable set greedoids
- Title not available (Why is that?)
- Layered clusters of tightness set functions
- A convex polytope and an antimatroid for any given, finite group
- Monge extensions of cooperation and communication structures
- Resolutions of convex geometries
- Join-semidistributive lattices and convex geometries.
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Axiomatizations of the Shapley value for games on augmenting systems
- Induced layered clusters, hereditary mappings, and convex geometries
- Graph operations that are good for greedoids
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- Greedy algorithm compatibility and heavy-set structures
- The sorting order on a Coxeter group.
- Local maximum stable set greedoids stemming from very well-covered graphs
- Discrete convex analysis
This page was built for publication: Greedoids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810029)