A set coverage problem

DOI10.1016/J.IPL.2009.11.012zbMATH Open1197.05156DBLPjournals/ipl/ZhangC10OpenAlexW2141658073WikidataQ58494670 ScholiaQ58494670MaRDI QIDQ990137FDOQ990137

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On biclique coverings
• Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

Cited In (5)

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

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)