Department of Computer Science and Engineering, Texas A&M University, College Station, Texas, USA
Nate Veldt
Optimal LP Rounding and Linear-Time Approximation Algorithms for Clustering Edge-Colored Hypergraphs