Theoretical computer science · Oct 6, 2026
Uniform sparsest cut: hardness and semidefinite gaps
Proves that approximating Uniform Sparsest Cut within any fixed constant factor is NP-hard, even with nonnegative rational capacities and unit demands. The Goemans–Linial semidefinite relaxation also has integrality gaps of order at least , approaching the square-root-logarithmic upper bound.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model