Goto

Collaborating Authors

 Africa







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.