A characterization of threshold matroids

DOI10.1016/0012-365X(80)90119-3zbMath0443.05028OpenAlexW2070813765MaRDI QIDQ1144029

Rick Giles, Ravindran Kannan

Publication date: 1980

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(80)90119-3

zbMATH Keywords

knapsack problemthreshold independence systemsthreshold matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

Knapsack polytopes: a survey, Polynomial-time algorithms for regular set-covering and threshold synthesis, Separable and equatable hypergraphs, Monotone clutters, Regular (2, 2)-systems, Monotonicity of polymatroids

Cites Work

• Faces for a linear inequality in 0–1 variables
• A bound for the number of matroids
• Unnamed Item
• Unnamed Item