Memory-EfficientApproximationAlgorithmsfor MAX-K-CUTandCorrelationClustering
–Neural Information Processing Systems
Largescale instances of SDPs, thus, present a memory bottleneck. In this paper, we develop simple polynomial-time Gaussian sampling-based algorithms for these twoproblems thatuseO(n+|E|)memory andnearly achievethebestexisting approximation guarantees.
Neural Information Processing Systems
Feb-8-2026, 10:37:20 GMT
- Country:
- Africa > Sudan (0.04)
- Asia
- Afghanistan > Parwan Province
- Charikar (0.04)
- India > Maharashtra
- Mumbai (0.04)
- Afghanistan > Parwan Province
- Oceania > Australia (0.04)
- Genre:
- Research Report (0.46)
- Technology: