acceptodds
Preprint in the OpenAI Math release

Near-square-root logarithmic integrality gaps for uniform sparsest cut

OpenAI

Abstract

We construct uniform sparsest-cut instances whose Goemans–Linial semidefinite integrality gap is at least along a sequence . The demand is one between every pair of distinct vertices, and the capacities are nonnegative real numbers. This matches the Arora–Rao–Vazirani upper bound up to a power of .

open until 1 Jan 2028

est. 50% chance this result is independently verified by the end of 2027.

Not verified 50%Verified 50%

What do you think this paper will get?

All positions stay anonymous.

Discussion (0)

Sign in to comment.