Incremental complexity of a bi-objective hypergraph transversal problem
Computational Complexity
2015-05-25 v1
Abstract
The hypergraph transversal problem has been intensively studied, from both a theoretical and a practical point of view. In particular , its incremental complexity is known to be quasi-polynomial in general and polynomial for bounded hypergraphs. Recent applications in computational biology however require to solve a generalization of this problem, that we call bi-objective transversal problem. The instance is in this case composed of a pair of hypergraphs (A, B), and the aim is to find minimal sets which hit all the hyperedges of A while intersecting a minimal set of hyperedges of B. In this paper, we formalize this problem, link it to a problem on monotone boolean -- formulae of depth 3 and study its incremental complexity.
Cite
@article{arxiv.1505.06025,
title = {Incremental complexity of a bi-objective hypergraph transversal problem},
author = {Ricardo Andrade and Etienne Birmelé and Arnaud Mary and Thomas Picchetti and Marie-France Sagot},
journal= {arXiv preprint arXiv:1505.06025},
year = {2015}
}