Independent sets in semi-random hypergraphs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1222591 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1380608 (Why is no real title available?)
- A New Algorithm for the Robust Semi-random Independent Set Problem
- Approximating coloring and maximum independent sets in 3-uniform hypergraphs
- Approximation algorithms for semi-random partitioning problems
- Approximations of Weighted Independent Set and Hereditary Subset Problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Coloring Random and Semi-Random k-Colorable Graphs
- Consistency of spectral hypergraph partitioning under planted partition model
- Constant factor approximation for balanced cut in the PIE model
- Exact recovery in the hypergraph stochastic block model: a spectral algorithm
- Finding and certifying a large hidden clique in a semirandom graph
- Global optimization with polynomials and the problem of moments
- Heuristics for semirandom graph problems
- How to Play Unique Games Against a Semi-random Adversary: Study of Semi-random Models of Unique Games
- Hypergraph theory in wireless communication networks
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
- Inapproximability of vertex cover and independent set in bounded degree graphs
- Independent sets in bounded-degree hypergraphs
- Independent sets in semi-random hypergraphs
- Linear degree extractors and the inapproximability of max clique and chromatic number
- Planted Models for k-Way Edge and Vertex Expansion
- Reducibility among combinatorial problems
- Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery
- Semidefinite programming relaxations for semialgebraic problems
- UG-hardness to NP-hardness by losing half
Cited in
(2)
This page was built for publication: Independent sets in semi-random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832900)
