Independent Sets in Bounded-Degree Hypergraphs
From MaRDI portal
Recommendations
- Independent sets in bounded-degree hypergraphs
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- scientific article; zbMATH DE number 1003268
- Improved approximations of independent sets in bounded-degree graphs
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
Cited in
(15)- Independent sets in bounded-degree hypergraphs
- Lower bounds for constant degree independent sets
- On the number of independent sets in simple hypergraphs
- SDP-based algorithms for maximum independent set problems on hypergraphs
- Locally defined independence systems on graphs
- Greed is good: approximating independent sets in sparse and bounded-degree graphs
- The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent
- scientific article; zbMATH DE number 5901714 (Why is no real title available?)
- SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs
- Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
- Hypergraph Independent Sets
- scientific article; zbMATH DE number 1445320 (Why is no real title available?)
- Differential Methods for Finding Independent Sets in Hypergraphs
- A better differential approximation ratio for symmetric TSP
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
This page was built for publication: Independent Sets in Bounded-Degree Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603532)