A set coverage problem

DOI10.1016/J.IPL.2009.11.012MaRDI QIDQ990137zbMATHOpenAlexDBLPWikidataFDO

Authors J. Martínez

Publication date 2 September 2010

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2009.11.012

zbMATH Keywords

combinatorial problemsBoolean rankSperner's theorembipartite covering

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Extremal set theory (05D05)

Recommendations

• On biclique coverings
• scientific article; zbMATH DE number 1439493
• Fractional biclique covers and partitions of graphs
• scientific article; zbMATH DE number 4053683
• Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

Cites work

• scientific article; zbMATH DE number 3781471 (Why is no real title available?)
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 1405679 (Why is no real title available?)
• On biclique coverings
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

Cited in

(5)

• A Best Covering Problem.
• Strict group testing and the set basis problem
• Set cover problems with small neighborhood covers
• An algorithm for set covering problem
• A procedure for solution of the problem of optimal covering of a finite set

This page was built for publication: A set coverage problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990137)