Parameterized Query Complexity of Hitting Set using Stability of Sunflowers

07/17/2018
by   Arijit Bishnu, et al.
0

In this paper, we study the query complexity of parameterized decision and optimization versions of Hitting-Set, Vertex Cover, Packing , and Max-Cut. The main focus is the query complexity of Hitting Set. In doing so, we use an oracle known as introduced by Beame et al. BeameHRRS18 and its generalizations to hypergraphs. The query models considered are the and oracles : (i) the oracle takes as input d pairwise disjoint non-empty vertex subsets A_1, ..., A_d in a hypergraph H and answers whether there is a hyperedge with vertices in each A_i, (ii) the oracle takes the same input and returns a hyperedge that has vertices in each A_i; NULL, otherwise. The and oracles are used for the decision and optimization versions of the problems, respectively. For d=2, we refer and as and , 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/13/2022

Faster Counting and Sampling Algorithms using Colorful Decision Oracle

In this work, we consider d-Hyperedge Estimation and d-Hyperedge Sample ...
research
08/12/2019

Hyperedge Estimation using Polylogarithmic Subset Queries

A hypergraph H is a set system (U( H), F(H)), where U( H) denotes the s...
research
08/02/2018

Triangle Estimation using Polylogarithmic Queries

Estimating the number of triangles in a graph is one of the most fundame...
research
11/07/2022

Nearly optimal independence oracle algorithms for edge estimation in hypergraphs

We study a query model of computation in which an n-vertex k-hypergraph ...
research
06/05/2023

Hyper-distance Oracles in Hypergraphs

We study point-to-point distance estimation in hypergraphs, where the qu...
research
02/22/2023

Hitting the Romans

Roman domination is one of few examples where the related extension prob...
research
08/07/2016

A General Characterization of the Statistical Query Complexity

Statistical query (SQ) algorithms are algorithms that have access to an ...

Please sign up or login with your details

Forgot password? Click here to reset