Minimal edge cover of the hypergraph We know that minimal edge cover for the normal graph is polynomial time solvable.
Is it also true for hypergraph?
The polynomial algorithm for "classical" graph is based on a maximum matching algorithm completed with the isolated nodes. 3-dimensional matching is known to be NP-complete (https://en.wikipedia.org/wiki/3-dimensional_matching). This is a case of minimal edge cover for hypergraph. Thus the answer is no.