The following pages link to Note on Independence Functions (Q3255413):
Displaying 49 items.
- Pairwise kidney exchange (Q813943) (← links)
- Evolutionary algorithms and matroid optimization problems (Q848644) (← links)
- Combinatorial geometries representable over GF(3) and GF(q). I: The number of points (Q911051) (← links)
- Valuated matroids: A new look at the greedy algorithm (Q913805) (← links)
- Lifts of matroid representations over partial fields (Q968453) (← links)
- Randomized priority algorithms (Q974749) (← links)
- The \(S\)-digraph optimization problem and the greedy algorithm (Q1019296) (← links)
- An algorithm for finding a matroid basis which maximizes the product of the weights of the elements (Q1068836) (← links)
- Algebraic characteristic sets of matroids (Q1073802) (← links)
- A greedy algorithm for hereditary set systems and a generalization of the Rado-Edmonds characterization of matroids (Q1102299) (← links)
- The incidence structure of subspaces with well-scaled frames (Q1110520) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- The greedy algorithm for partially ordered sets (Q1140103) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Finite prime-field characteristic sets for planar configurations (Q1170246) (← links)
- On the diameter of convex polytopes (Q1193432) (← links)
- The basis monomial ring of a matroid (Q1237740) (← links)
- Bimatroids and invariants (Q1254324) (← links)
- Pfaffian structures and critical problems in finite symplectic spaces (Q1293433) (← links)
- An algorithm to compute the set of characteristics of a system of polynomial equations over the integers. (Q1401152) (← links)
- Hereditary systems and greedy-type algorithms. (Q1414589) (← links)
- A greedy algorithm for some classes of integer programs. (Q1417561) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- The algebraic geometry of Kazhdan-Lusztig-Stanley polynomials (Q1755916) (← links)
- A disturbed version of the greedy algorithm (Q1808486) (← links)
- An analysis of the greedy algorithm for the submodular set covering problem (Q1838034) (← links)
- On Dowling geometries of infinite groups (Q1881688) (← links)
- Computing knapsack solutions with cardinality robustness (Q1926647) (← links)
- A new greedy algorithm for the quadratic assignment problem (Q1940429) (← links)
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- General bounds for incremental maximization (Q2118105) (← links)
- Formal barriers to simple algorithms for the matroid secretary problem (Q2152122) (← links)
- Common information, matroid representation, and secret sharing for matroid ports (Q2220766) (← links)
- The templates for some classes of quaternary matroids (Q2221928) (← links)
- The excluded minors for the class of matroids that are binary or ternary (Q2275478) (← links)
- Matroid representation of clique complexes (Q2381814) (← links)
- Modularity and greed in double auctions (Q2411517) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- On the unique representability of spikes over prime fields (Q2502909) (← links)
- Reciprocity in matroid lattices (Q2523728) (← links)
- Applications of Menger's graph theorem (Q2527630) (← links)
- Uniformität des Verbandes der Partitionen (Q2559495) (← links)
- The Kazhdan-Lusztig polynomial of a matroid (Q2629100) (← links)
- Representability of matroids by \(c\)-arrangements is undecidable (Q2696633) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- A greedy algorithm for maximizing a linear objective function (Q2773612) (← links)
- The free product of M-fuzzifying matroids1 (Q2988582) (← links)
- Problems on independence systems solvable by the greedy algorithm (Q3225892) (← links)
- Characteristic sets of matroids (Q6201922) (← links)
