Note on Independence Functions
From MaRDI portal
Cited in
(64)- The \(S\)-digraph optimization problem and the greedy algorithm
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements
- Algebraic characteristic sets of matroids
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids
- The incidence structure of subspaces with well-scaled frames
- Generalized polymatroids and submodular flows
- The greedy algorithm for partially ordered sets
- Discrete extremal problems
- Finite prime-field characteristic sets for planar configurations
- On the diameter of convex polytopes
- The basis monomial ring of a matroid
- Bimatroids and invariants
- Pfaffian structures and critical problems in finite symplectic spaces
- An algorithm to compute the set of characteristics of a system of polynomial equations over the integers.
- Hereditary systems and greedy-type algorithms.
- A greedy algorithm for some classes of integer programs.
- Improving the linear programming technique in the search for lower bounds in secret sharing
- The algebraic geometry of Kazhdan-Lusztig-Stanley polynomials
- A disturbed version of the greedy algorithm
- An analysis of the greedy algorithm for the submodular set covering problem
- On Dowling geometries of infinite groups
- Computing knapsack solutions with cardinality robustness
- A new greedy algorithm for the quadratic assignment problem
- A greedy algorithm for finding maximum spanning trees in infinite graphs
- General bounds for incremental maximization
- Formal barriers to simple algorithms for the matroid secretary problem
- Common information, matroid representation, and secret sharing for matroid ports
- The templates for some classes of quaternary matroids
- The excluded minors for the class of matroids that are binary or ternary
- Matroid representation of clique complexes
- Modularity and greed in double auctions
- Approximating the least core value and least core of cooperative games with supermodular costs
- On the unique representability of spikes over prime fields
- Reciprocity in matroid lattices
- Applications of Menger's graph theorem
- Uniformität des Verbandes der Partitionen
- The Kazhdan-Lusztig polynomial of a matroid
- Representability of matroids by c-arrangements is undecidable
- Secret sharing on regular bipartite access structures
- A greedy algorithm for maximizing a linear objective function
- The free product of M-fuzzifying matroids
- Problems on independence systems solvable by the greedy algorithm
- A greedy algorithm for solving a certain class of linear programmes
- Revised Greedy algorithm for formation of a minimal cycle basis of a graph
- Constructing Prime-Field Planar Configurations
- Minimal dependent sets
- scientific article; zbMATH DE number 3298861 (Why is no real title available?)
- Matroids and the greedy algorithm
- Infinite Matroids
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Von Staudt constructions for skew-linear and multilinear matroids
- Robust independence systems
- Characteristic sets of matroids
- The frontier of intractability for EFX with two agents
- A note on robust subsets of transversal matroids
- The frontier of intractability for EFX with two agents
- Out of the parking lot and into the forest: parking functions, bond lattices, and unimodal forests
- A formal analysis of algorithms for matroids and greedoids
- Pairwise kidney exchange
- Evolutionary algorithms and matroid optimization problems
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points
- Valuated matroids: A new look at the greedy algorithm
- Lifts of matroid representations over partial fields
- Randomized priority algorithms
This page was built for publication: Note on Independence Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3255413)
