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
- Concepts of dimension for convex geometries
- Knowledge spaces from a topological point of view
- Introduction to the combinatorial atlas
- A characteristic polynomial for rooted mixed graphs
- On the diameter of tree associahedra
- The Bhargava greedoid as a Gaussian elimination greedoid
- Impartial achievement games on convex geometries
- Choice resolutions
- CONDITIONAL LOGIC IS COMPLETE FOR CONVEXITY IN THE PLANE
- Strong IP formulations need large coefficients
- Augmenting and decreasing systems
- Tropical Carathéodory with matroids
- Log-concave poset inequalities
- Cospanning characterizations of violator and co-violator spaces
- Two flags in a semimodular lattice generate an antimatroid
- Tabling with sound answer subsumption
- Critical sets, crowns and local maximum independent sets
- A greedy algorithm for dropping digits
- Characterizations of polygreedoids and poly-antimatroids by greedy algorithms
- A greedoid and a matroid inspired by Bhargava's \(p\)-orderings
- Polyhedral approach to weighted connected matchings in general graphs
- A Geometric Characterization of Poly-antimatroids
- Krein-Milman spaces
- Antimatroids and balanced pairs
- Sufficient conditions for the optimality of the greedy algorithm in greedoids
- Factorisation of greedoid polynomials of rooted digraphs
- New polyhedral and algorithmic results on greedoids
- Title not available (Why is that?)
- Characterizations of graph classes via convex geometries: a survey
- Reconfiguring (non-spanning) arborescences
- A disturbed version of the greedy algorithm
- Secretary problem: graphs, matroids and greedoids
- A value for cooperative games on simplicial complexes with a filtration
- Oracles for vertex elimination orderings
- A discrete duality between nonmonotonic consequence relations and convex geometries
- Subspace Procrustes analysis
- Impartial hypergraph games
- Strong greedoid structure of \(r\)-removed \(P\)-orderings
- Valuated matroids -- a new look at the greedy algorithm
- Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive super\-matroid
- Exchange systems
- Partition coefficients of acyclic graphs
- Operations on greedoids
- Diverse data selection via combinatorial quasi-concavity of distance covariance: a polynomial time global minimax algorithm
- The computational complexity of antimatroid properties
- A system-theoretic model for cooperation, interaction and allocation
- Fuzzy greedoids
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)
