Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs.

Nate Veldt

Browse the full ICML paper archive.