pith. sign in

arxiv: 0910.2024 · v2 · submitted 2009-10-11 · 💻 cs.DS · math.FA

A (log n)^(Ω(1)) integrality gap for the Sparsest Cut SDP

classification 💻 cs.DS math.FA
keywords omegaintegralitysparsestachievedboundscentercosetsdegeneration
0
0 comments X
read the original abstract

We show that the Goemans-Linial semidefinite relaxation of the Sparsest Cut problem with general demands has integrality gap $(\log n)^{\Omega(1)}$. This is achieved by exhibiting $n$-point metric spaces of negative type whose $L_1$ distortion is $(\log n)^{\Omega(1)}$. Our result is based on quantitative bounds on the rate of degeneration of Lipschitz maps from the Heisenberg group to $L_1$ when restricted to cosets of the center.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Performance Isolation and Semantic Determinism in Efficient GPU Spatial Sharing

    cs.DC 2026-03 unverdicted novelty 6.0

    CoGPU resolves the tradeoff in GPU sharing by introducing GPU coroutines for semantic-preserving resource migration, delivering up to 79.2% higher training throughput and zero token mismatch in inference.

  2. FlexPipe: Adapting Dynamic LLM Serving Through Inflight Pipeline Refactoring in Fragmented Serverless Clusters

    cs.DC 2025-10 unverdicted novelty 5.0

    FlexPipe introduces runtime pipeline refactoring for LLMs to achieve higher resource efficiency and lower latency in serverless GPU clusters with fragmentation.