Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion
From MaRDI portal
Publication:2830864
Recommendations
- Approximation algorithms for hypergraph small set expansion and small set vertex expansion
- Min-Max Graph Partitioning and Small Set Expansion
- Graph expansion and the unique games conjecture
- Minimizing the union: tight approximations for small set bipartite vertex expansion
- Hypergraph Markov Operators, Eigenvalues and Approximation Algorithms
Cites work
Cited in
(6)- Minimizing the union: tight approximations for small set bipartite vertex expansion
- Graph expansion and the unique games conjecture
- The small set vertex expansion problem
- Finding Cheeger cuts in hypergraphs via heat equation
- Approximation algorithms for hypergraph small set expansion and small set vertex expansion
- The small set vertex expansion problem
This page was built for publication: Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830864)