Pages that link to "Item:Q2969629"

The following pages link to Approximation Algorithms for Hypergraph Small Set Expansion and Small Set Vertex Expansion (Q2969629):

Displaying 12 items.

• On set expansion problems and the small set expansion conjecture (Q494429) (← links)
• SDP primal-dual approximation algorithms for directed hypergraph expansion and sparsest cut with product demands (Q1791038) (← links)
• The Small Set Vertex expansion problem (Q2232595) (← links)
• On a connection between small set expansions and modularity clustering (Q2446591) (← links)
• The small set vertex expansion problem (Q2692218) (← links)
• Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion (Q2830864) (← links)
• Graph expansion and the unique games conjecture (Q2875199) (← links)
• Gap Amplification for Small-Set Expansion via Random Walks. (Q2969633) (← links)
• The Densest $k$-Subhypergraph Problem (Q3174693) (← links)
• Approximation Algorithms for CSPs (Q4993604) (← links)
• Breaking the<i>r</i>_maxBarrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
• Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery (Q5002784) (← links)