Parameterized query complexity of hitting set using stability of sunflowers
From MaRDI portal
Publication:5091015
Recommendations
Cites work
- A near-optimal sublinear-time algorithm for approximating the minimum vertex cover size
- Approximating average parameters of graphs
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract)
- Computing exact minimum cuts without knowing the graph
- Edge estimation with independent set oracles
- Intersection Theorems for Systems of Sets
- Introduction to Property Testing
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph
- Parameterized algorithms
- Parameterized testability
- Set cover in sub-linear time
Cited in
(4)
This page was built for publication: Parameterized query complexity of hitting set using stability of sunflowers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091015)