Parameterized query complexity of hitting set using stability of sunflowers
Leibniz International Proceedings in Informatics, LIPIcs
In this paper, we study the query complexity of parameterized decision and optimization versions of Hitting-Set. We also investigate the query complexity of Packing. In doing so, we use generalizations to hypergraphs of an earlier query model, known as BIS introduced by Beame et al. in ITCS'18. The query models considered are the GPIS and GPISE oracles. The GPIS and GPISE oracles are used for the decision and optimization versions of the problems, respectively. We use color coding and queries to the oracles to generate subsamples from the hypergraph, that retain some structural properties of the original hypergraph. We use the stability of the sunflowers in a non-trivial way to do so.
Bishnu, Arijit; Ghosh, Arijit; Kolay, Sudeshna; Mishra, Gopinath; and Saurabh, Saket, "Parameterized query complexity of hitting set using stability of sunflowers" (2018). Conference Articles. 34.