Fractional covers of hypergraphs with bounded multi-intersection

DOI10.1016/j.tcs.2023.114204OpenAlexW3040087842MaRDI QIDQ6057846

Igor Razgon, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler

Publication date: 26 October 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114204

zbMATH Keywords

hypergraphsfractional graph theoryfractional edge coverfractional hypertree widthfractional hitting set

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Matchings and covers in hypergraphs
• Size Bounds and Query Plans for Relational Joins
• Generalized hypertree decompositions: NP-hardness and tractable variants
• Constraint solving via fractional edge covers
• Hitting Set for hypergraphs of low VC-dimension
• Complexity Analysis of Generalized and Fractional Hypertree Decompositions
• HyperBench
• On the Fractional Covering Number of Hypergraphs

This page was built for publication: Fractional covers of hypergraphs with bounded multi-intersection