Complexity dichotomies for the MINIMUM F-OVERLAY problem

For a (possibly infinite) fixed family of graphs F, we say that a graph F, overlays on a hypergraph H if V (H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph. While it is easy to see that the complete graph on vertical bar V (H)vertical bar overlays F on a hypergraph H whenever the problem admits a solution, the MINIMUM F-OVERLAY problem asks for such a graph with at most k edges, for some given k is an element of N. This problem allows to generalize some natural problems which may arise in practice. For instance, if the family contains all connected graphs, then MINIMUM F-OVERLAY corresponds to the MINIMUM CONNECTIVITY INFERENCE problem (also known as SUBSET INTERCONNECTION DESIGN problem) introduced for the low-resolution reconstruction of macro-molecular assembly in structural biology, or for the design of networks. Our main contribution is a strong dichotomy result regarding the polynomial vs. NP-complete status with respect to the considered family F. Roughly speaking, we show that the easy cases one can think of (e.g. when edgeless graphs of the right sizes are in F, or if contains only cliques) are the only families giving rise to a polynomial problem: all others are NP-complete. We then investigate the parameterized complexity of the problem and give similar sufficient conditions on F that give rise to W[1]-hard, W[2]-hard or FPT problems when the parameter is the size of the solution. This yields an FPT/W[1]-hard dichotomy for a relaxed problem, where every hyperedge of H must contain some member of F as a (non necessarily spanning) subgraph. (C) 2018 Published by Elsevier B.V.