Graph expansion and the unique games conjecture

@inproceedings{Raghavendra2010GraphEA,
  title={Graph expansion and the unique games conjecture},
  author={Prasad Raghavendra and David Steurer},
  booktitle={STOC},
  year={2010}
}
The edge expansion of a subset of vertices S ⊆ V in a graph G measures the fraction of edges that leave S. In a d-regular graph, the edge expansion/conductance Φ(S) of a subset S ⊆ V is defined as Φ(S) = (|E(S, V\S)|)/(d|S|). Approximating the conductance of small linear sized sets (size δ n) is a natural optimization question that is a variant of the well-studied Sparsest Cut problem. However, there are no known algorithms to even distinguish between almost complete edge expansion (Φ(S) = 1… CONTINUE READING
Highly Influential
This paper has highly influenced 18 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 182 citations. REVIEW CITATIONS
118 Citations
0 References
Similar Papers

Citations

Publications citing this paper.

182 Citations

0102030'11'13'15'17
Citations per Year
Semantic Scholar estimates that this publication has 182 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…