Partial covering of hypergraphs

MaRDI QIDQ2921715zbMATH OpenFDO

Authors Özgür Sümer

Publication date 13 October 2014

zbMATH Keywords

greedy algorithmpartial hypergraph coverpartial set cover

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Partial covers of graphs
• Covers in partitioned intersecting hypergraphs
• Covering a hypergraph of subgraphs
• scientific article; zbMATH DE number 3887743
• Multicovering hypergraphs
• Covering non-uniform hypergraphs
• Near perfect coverings in graphs and hypergraphs
• scientific article; zbMATH DE number 2081019
• On covering numbers of regular hypergraphs
• Covering complete partite hypergraphs by monochromatic components

Cited in

(9)

• Near perfect coverings in graphs and hypergraphs
• Fractional v. integral covers in hypergraphs of bounded edge size
• Improved performance of the greedy algorithm for partial cover
• -almost selectors and their applications
• scientific article; zbMATH DE number 3887743 (Why is no real title available?)
• Analysis of greedy algorithm for vertex covering of random graph by cubes
• Covering analysis of the greedy algorithm for partial cover
• A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
• An approximation algorithm for the partial vertex cover problem in hypergraphs

This page was built for publication: Partial covering of hypergraphs

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