Efficient Approximation of Fractional Hypertree Width

Viktoriia Korchemna, Daniel Lokshtanov, Saket Saurabh +2

We give two new approximation algorithms to compute the fractional hypertree width of an input hypergraph. The first algorithm takes as input $n$-vertex $m$-edge hypergraph $H$ of…