For every fixed C>1, approximating Uniform Sparsest Cut within factor C is NP-hard on graphs with nonnegative rational capacities and unit demand between every pair of distinct vertices.
For every fixed C>1, approximating Uniform Sparsest Cut within factor C is NP-hard on graphs with nonnegative rational capacities and unit demand between every pair of distinct vertices.
For every fixed C>1, approximating Uniform Sparsest Cut within factor C is NP-hard on graphs with nonnegative rational capacities and unit demand between every pair of distinct vertices.
If correct, rules out every fixed constant approximation ratio for Uniform Sparsest Cut unless P=NP.
Is Uniform Sparsest Cut NP-hard to approximate within every fixed constant factor?
Publication dates and editorial changes.
OpenAI reports arbitrary-constant NP-hardness for Uniform Sparsest Cut
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
